LASTDIG - The last digit

Nestor 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 him two numbers a and b. The problem consist of finding the last digit of the potency of base a and index b. Help Nestor with his problem. You are given two integer numbers: the base a (0 ≤ a ≤ 20) and the index b (0 ≤ b ≤ 2,147,483,000), a and b both are not 0. You have to find the last digit of ab.

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.

Example

Input:
2
3 10
6 2

Output:
9
6

Added by:Jose Daniel Rodriguez Morales
Date:2008-12-01
Time limit:1s
Source limit:700B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: GOSU
Resource:Own

hide comments
2012-09-14 17:36:48 rifky alif
crap.. why is this problem has a limit size of file to submit (700 bytes) ? my file that only 1kb can't be submitted !

Last edit: 2011-11-09 07:31:22
2012-09-14 17:36:48 Rishabh Raj
need to know some test cases.., mine is correct i.e 1 for 0^0 and all others i tried.
2012-09-14 17:36:48 Nnavneetsinha
do forget to try
0 0
2012-09-14 17:36:48 Arvind
nice prob..
2012-09-14 17:36:48 hammad awan
can i get your email adress Numerix?????
2012-09-14 17:36:48 Boopathi Rajaa
@kusum
try these
9 0
0 9
0 0
2012-09-14 17:36:48 kusum
can someone please post some strong test cases...I keep getting WA
2012-09-14 17:36:48 Robin Lee
Note: "Last digit of potency" seems to be incorrect, i.e. LDoP of (20^2=400) is 0, not 4.

Last edit: 2011-06-03 16:57:57
2012-09-14 17:36:48 saurabh kumar jha
is 0 00000 a valid input???
2012-09-14 17:36:48 Avinash
Can i use scanf and cout both simultaneously with g++ 4.0.0-8 compiler?
i also use <stdio.h> and <iostream.h>
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.