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
2014-03-21 10:21:57 Gaurav Agrawal
//why its showing wrong answer..need help

--ans+edit(Francky)--> Did you see the bottom of the page about comment ?

Last edit: 2014-03-21 10:50:12
2014-03-18 15:19:36 Pulkit Singhal
AC in 1 go :)
Only 98 bytes code in python
2014-02-27 20:02:23 A.SANDEEP
Error

Your solution is too long for this problem, the limit is 700 bytes! ????? what is this.. ??
2014-02-18 20:31:29 Snehasish Sen
@11089420 showing sigsev in spoj compiler but runs fine in my pc
2014-02-12 19:22:55 RAJAT SINGH
simple one
2014-01-11 16:09:05 userx
@ARPIT SAINI a, b both cannot be zero... :-p
2014-01-10 19:54:08 appy
i m getting the correct ans for
0 to power 0 is 1
0 to power anything is 0
also and all other cases..but still getting wrong answer...please help me ..is there any enter input after the last digit ??????
2014-01-03 14:33:45 Ankush Bhalotia
I cheated in this problem :P
Using macros for recurring keywords and removing all blankspaces, tabs and newlines, I brought down the source size from 1400B to 700B.
2013-12-22 23:09:46 ehab
Hint:
BigInteger B=new BigInteger(base+"");
B=B.pow(exponent);
2013-12-19 15:23:13 NOVICE
Refer Modular Exponentiation______....This will also help in cryptography(RSA Encryption).
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.