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
2016-03-18 16:54:15
Tried with all possible test case, works fine on ideone. But SPOJ says wrong answer.
Help please <snip>. Cant figure out what's wrong :(

Last edit: 2023-06-12 22:41:57
2016-03-16 17:38:46
" a and b both are not 0" - why the hell someone has written this line .. wasted 4 attempts.
2016-03-14 15:27:53
forgot to Put return 0
Cost me 1 WA!!
green in 2nd go :D
2016-02-12 07:14:35
easy one...ac in one go :) .... remember to include case b=0 differently.
2016-02-06 15:07:39
Think Alter
2016-02-04 19:21:49
gud one..!!!
2016-01-25 16:35:19
Learned a new algorithm. Modular Exponentiation! :)
2016-01-22 07:13:45
just get the md = b % 4
if md == 0 then md = 4
and multiply a md times
after that get the last digit
:D
2016-01-19 16:17:25
@g4mewarrior thanks :) helped a lot

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.