Exponentiation

import sys
sys.setrecursionlimit(5000)

h = int(input())
answers = []
modulo = 10**9 + 7

def modpower(x, n, m):
    u = 1 % m 
    base = x
    while n != 0:
        if (n%2==1): u = (u*base)%m
        base = (base*base) % m
        n //= 2
    return u

    if n == 0: return 1 % m 
    u = modpower(x, n//2, m)
    u =(u*u)%m
    if (n%2==1): u = (u*x)%m
    return u

for i in range(h):
    a, b = [int(x) for x in input().split()]
    # print(modpower(a, b, modulo))
    if b == 0: answers.append(str(1 % modulo))
    else: answers.append(str(modpower(a, b, modulo)))

print("\n".join(answers))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED