Given 'n' cities and each city is connected to the other by a direct road. You are currently at your hometown. You have to wander around the city and come back in exactly 'x' trips. In one trip, you can go from the current city to any different city. Find the number of ways to travel around so that after exactly 'x' steps, you should be at your hometown city.

Example inputs :
n=3 ; x=3

possible ways :
1->2->3->1
1->3->2->1

2 ways