#include using namespace std; using ll=long long; using pii=pair; #define all(a) a.begin(),a.end() #define pb push_back #define sz(a) ((int)a.size()) const int mod=998244353,K=119<<8,Y=119<<11,cycle=(mod-1)/(Y*2); int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;} int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;} int mul(int x, int y){return ((ll)x)*y%mod;} int Pow(int x, ll y=mod-2){int res=1; for(; y; x=mul(x,x),y>>=1) if(y&1) res=mul(res,x); return res;} int a,n,pw[K+1],pw_K[(mod-1)/K+1],pw2[cycle+1],inv[2][cycle+1]; void ahcorz(){ cin >> a >> n; pw[0]=1,pw_K[0]=1; for(int i=1; i<=K; ++i) pw[i]=mul(pw[i-1],a); for(int i=1; i<=(mod-1)/K; ++i) pw_K[i]=mul(pw_K[i-1],pw[K]); for(int i=0; i> t; while(t--) ahcorz(); }