For this Question: You are given 2 numbers a, b.

You can perform at most b steps

In one step :
1- increase a by 3
2- decrease a by 3
3- multiply a by 2

Find number of distinct numbers we can make after performing at most b operations on a.The first line contains the number of tests T.

For each test case: 
Input two integers a and b.

0 < T <= 100
1 <= a <= 100000
1 <= b <= 9Print answer on a separate line for each test caseSample Input
2
5 1
30 2

Sample Output
4
11

For test 1:-
In 0 steps, 5 can be formed
In 1 steps 2, 8, 10 can be formed

For test 2:-
in 0 step :- 30
in 1 step- 27 33 60
in 2 step:- 24, 30, 54, 30, 36, 66, 57 63 120

total unique number = 11, I have written this Solution Code: T = int(input())
for t in range(T):
	n, k = map(int, input().strip().split())
	s = set()
	s.add(n)
	l = list(s)
	while(k):
		for i in range(len(l)):
			s.add(l[i]-3)
			s.add(l[i]+3)
			s.add(l[i]*2)
		l = list(s)
		k -= 1
	print(len(s)), In this Programming Language: Python, Now tell me if this Code is compilable or not?