UJ - Uncle Jack : Classical

#The solution in Python 3 is as follows:

while True:
    N, D = map(int, input().split())
    if N==0 and D==0: break
    print (pow(N, D))                                    #Output follows this pattern


#Keep visiting for more solutions of SPOJ problems in Python 3.Thank you!!!