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 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.
Example
Input: 2 3 10 6 2
Output: 9 6
hide comments
saurav_paul:
20190303 19:15:02
Accept in one go .


aj_254:
20190226 14:37:58
if you want AC in python dont use pattern strategy use modulo .. 

bitbeast18:
20190118 15:26:23
Has anybody done it in python?


adarsh313:
20190106 10:43:39
AC in 2nd attempt 

harshit_k007:
20181227 14:36:19
yes AC in 3 attempts...plse check case for b=0 , it costed me 2 WA!! 

tarun_nanduri:
20181222 18:52:43
why size limit of 700 bytes


Daniel Papp:
20181222 01:51:07
700 byte source code limit? Who came up with this really? 

chinmay_sharma:
20181208 18:16:13
again and again giving wrong answer here but on code blocks my code is giving correct answer for all nearly all possible cases


yaseenmollik:
20181205 19:03:07
Just use Modular Exponentiation 

deepak022:
20181028 12:29:03
solved 15 from 15 needed problems :) 
Added by:  Jose Daniel Rodriguez Morales 
Date:  20081201 
Time limit:  1s 
Source limit:  700B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: GOSU 
Resource:  Own 