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
2013-12-17 15:11:45 Samil Vargas
ohh god i tried this problem so many time and though that this shit was wrong but keep trying in my number 11 it work cause i saw a little problem try all the test cases from 0 0 till 10 5
2013-12-10 05:55:22 [Lakshman]
@Washington Please remove the below code.

Last edit: 2013-12-10 08:13:50
2013-12-10 01:19:14 Washington
Just kidding...
2013-12-10 01:17:53 Washington
Never was so easy:
<snip>

Last edit: 2023-06-12 22:47:13
2013-12-09 23:45:40 Ankit Jain
ac in 1 go...simple if u know how to calculate powers efficiently..:)
2013-11-06 06:17:33 Shashank Gupta
Easy AC in 0.00 time in C. :) Just use arrays and modulo operator. And remember that anything to the power of 0 is 1.
2013-11-05 13:49:17 Sourabh Verma
Accepted! 1^0 = 1 and 0^1 = 0.
This caused me 1 WA
2013-10-22 21:30:20 isif
can anyone send long tests? ex: a=12,14,16 and b = 2,147,483,000
2013-10-22 17:16:53 alampata
I am getting correct answer for all the test cases tried...even special ones...
plz someone give a look to my code
<snip>

Last edit: 2023-06-12 22:47:30
2013-09-02 17:11:51 Shashank
Getting wrong ans though code is correct. anyone help me please
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.