For this Question: Given any number S ending with 1. What will be the last 2 digits of the resultant number when raised to the power P?The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consists of string S and power P.

Constraints:
1 <= T <= 2*10^3
1 <= |S| <= 60
1 <= P <= 10^6Print the last 2 digit of the resultant. If answer is 1 digit number X, print 0X.Input:
2
1231 213
43591 194

Output:
91
61

Explanation:
Testcase 1: When (1231)^213 is calculated the last 2 digits appeared to be 91., I have written this Solution Code: t = int(input())

while (t):
	n, e = map(int, input().split())
	
	d = (((n // 10) % 10) * (e % 10)) % 10

	print(d, 1, sep='')
	
	t -= 1, In this Programming Language: Python, Now tell me if this Code is compilable or not?