#include <iostream>
#include <algorithm>
#include <assert.h>
#include <string>
using namespace std;

long long readInt(long long l,long long r,char endd){
	long long x=0;
	int cnt=0;
	int fi=-1;
	bool is_neg=false;
	while(true){
		char g=getchar();
		if(g=='-'){
			assert(fi==-1);
			is_neg=true;
			continue;
		}
		if('0'<=g && g<='9'){
			x*=10;
			x+=g-'0';
			if(cnt==0){
				fi=g-'0';
			}
			cnt++;
			assert(fi!=0 || cnt==1);
			assert(fi!=0 || is_neg==false);
			
			assert(!(cnt>19 || ( cnt==19 && fi>1) ));
		} else if(g==endd){
			assert(cnt>0);
			if(is_neg){
				x= -x;
			}
			assert(l<=x && x<=r);
			return x;
		} else {
			assert(false);
		}
	}
}
string readString(int l,int r,char endd){
	string ret="";
	int cnt=0;
	while(true){
		char g=getchar();
		assert(g!=-1);
		if(g==endd){
			break;
		}
		cnt++;
		ret+=g;
	}
	assert(l<=cnt && cnt<=r);
	return ret;
}
long long readIntSp(long long l,long long r){
	return readInt(l,r,' ');
}
long long readIntLn(long long l,long long r){
	return readInt(l,r,'\n');
}
string readStringLn(int l,int r){
	return readString(l,r,'\n');
}
string readStringSp(int l,int r){
	return readString(l,r,' ');
}

long long N,A;
int T;

int power9(long long b,long long k){
	long long ret= 1;
	long long p2=b%9;
	while(k){
		if(k%2){
			ret *= p2;
			ret %= 9;
		}
		p2 *= p2;
		p2 %= 9;
		k/=2;
	}
	return ret;
}



int main(){
	T=readIntLn(1,100000);
	while(T--){
		A=readIntSp(1,1000000000ll * 1000000000ll);
		N=readIntLn(1,1000000000ll * 1000000000ll);
		int ans = power9(A,N);
		if(ans == 0 ) ans = 9;
		printf("%d\n",ans);
	}
	assert(getchar()==-1);
}