#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;

ll qmod(ll a,ll b,ll mod)
{
    ll ans=1;
    while(b)
    {
        if(b%2)
        {
            ans=(ans*a)%mod;
        }
        b=b/2;
        a=(a*a)%mod;
    }
    return ans;
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       ll n,k;
       scanf("%lld %lld",&n,&k);
       double a=k*log10((double)n);
       a=a-floor(a);
       double ans1 = pow(10,a)*100;
       ll ans2 = qmod(n,k,1000);
       cout<<(ll)ans1<<"...";
       printf("%03lld\n",ans2);
    }
    return 0;
}