Company: Goldman_Sachs_12nov
Difficulty: medium
Road Trip Problem Description Momoko has a long weekend ahead and is planning a short road trip. Since it's the end of the month, her budget is limited. She wants to know which cities she can reach from her current city without exceeding her budget. There are N cities labeled 0 to N-1, connected by M bidirectional roads. Each road directly connects two cities, and costs exactly Rs. 1 to travel. Momoko begins her journey from a starting city S and has a total budget of Rs. P. Your task is to determine all the cities that Momoko can reach from city S by spending at most P Rs. The starting city itself should not be included. The output should list all reachable cities in ascending order. Read the input from STDIN and print the output to STDOUT. Do not print arbitrary strings anywhere in the program, as these contribute to the output and test cases will fail. Constraints - N >= 2 - Roads are bidirectional, with no self-loops or duplicate edges. - The starting city S is guaranteed to be con