Rohit was doing the work of his math class about three days but he is tired of make operations a lot and he should deliver his task tomorrow. His math’s teacher gives two numbers a and b. The problem consist in find the last digit of the potency of base a and index b. Help Rohit with his problem. You are given two integer numbers: the base a (number of digits d, such that 1 ≤ d ≤ 1000) and the index b (0 ≤ b ≤ 922*10^15). You
have to find the last digit of a^b.

Input

The first line of input contains an integer t, the number of test cases (t ≤ 30). t test cases follow. For each test case will appear a and b separated by space.

Output

For each test case output an integer per line representing the result.

SAMPLE INPUT
3
3 10
6 2
150 53

SAMPLE OUTPUT
9
6
0
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
p=int(raw_input(""));
def last(a,b):
  if a==3 or a==2 or a==7 or a==8:
    if b%4==0:
      n=str(a**4);
    else:
      n=str(a**(b%4));
  if a==0 or a==1 or a==5 or a==6:
    if b%1==0:
      n=str(a**1);
    else:
      n=str(a**(b%1));
  if a==4 or a==9:
    if b%2==0:
      n=str(a**2);
    else:
      n=str(a**(b%2));
  k=len(n);
  return n[k-1];
for i in range(0,p):
  a=raw_input("");
  k=a.split(" ");
  a=str(k[0]);
  a=int(a[len(a)-1]);
  b=int(k[1]);
  print last(a,b);