For this Question: Given a positive number X. Find all Jumping Numbers smaller than or equal to X. 
Jumping Number: A number is called Jumping Number if all adjacent digits in it differ by only 1. All single-digit numbers are considered as Jumping Numbers. For example 7, 8987 and 4343456 are Jumping numbers but 796 and 89098 are not.The first line of the input contains T denoting the number of test cases. Each test case contains a positive number N.

Constraints:
1 <= T <= 50
1 <= N <= 10^8For each test case, print a single line containing all the Jumping numbers less than or equal to N from 1 in increasing orderSample Input:
2
10
50

Sample Output:
1 2 3 4 5 6 7 8 9 10
1 2 3 4 5 6 7 8 9 10 12 21 23 32 34 43 45

Explanation:
Testcase 2: Here, the most significant digits of each jumping number is following increasing order, i.e., jumping numbers starting from 0, followed by 1, then 2 and so on, themselves being in increasing order 2, 21, 23., I have written this Solution Code: class Queue: 
	def __init__(self): 
		self.lst = [] 

	def is_empty(self): 
		return self.lst == [] 

	def enqueue(self, elem): 
		self.lst.append(elem) 

	def dequeue(self): 
		return self.lst.pop(0) 

 
def bfs(x, num,l): 

	q = Queue() 
	q.enqueue(num) 
	while (not q.is_empty()):
		num = q.dequeue() 

		if num<= x:
			l.append(num)
			last_dig = num % 10

			if last_dig == 0: 
				q.enqueue((num * 10) + (last_dig + 1)) 

			
			elif last_dig == 9: 
				q.enqueue((num * 10) + (last_dig - 1)) 

			else: 
				q.enqueue((num * 10) + (last_dig - 1)) 
	
				q.enqueue((num * 10) + (last_dig + 1))
def printJumping(x):
	l=[] 
	for i in range(1, 10): 
		bfs(x, i,l)
	l.sort()
	for i in l:
		print(i,end=" ")
	print("") 
t=int(input())
for i in range(t):
	x = int(input())
	printJumping(x), In this Programming Language: Python, Now tell me if this Code is compilable or not?