#include #include using namespace std; using namespace atcoder; using mint=static_modint<998244353>; //using mint = modint; //using mint=static_modint<1000000007>; using ll=long long; using ull=unsigned long long; using pl=pair; using vl=vector; #define rep(i,n) for(ll i=0;i<(ll)(n);++i) #define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i) #define rep1(i,n) for(ll i=1;i<=(ll)(n);++i) #define fi first #define se second #define pb push_back #define eb emplace_back #define be(v) (v).begin(),(v).end() const ll INF=4e18; templateinline ll at(T&w){return w.size();} #ifdef DEBUG template void check_range(T&w,auto&&a,const source_location& l){ if(a<0||a>=at(w)){ cerr<<"OORange! line "< decltype(auto)at(T&w,auto&&a,const source_location&l=source_location::current()){ check_range(w,a,l); // if slower, delete it. return w[a]; } template decltype(auto)at(T&w,auto&&a,auto&&b,const source_location&l=source_location::current()){ return at(at(w,a,l),b,l); } template decltype(auto)at(T&w,auto&&a,auto&&b,auto&&c,const source_location&l=source_location::current()){ return at(at(w,a,b,l),c,l); } template decltype(auto)at(T&w,auto&&a,auto&&b,auto&&c,auto&&d,const source_location&l=source_location::current()){ return at(at(w,a,b,c,l),d,l); } template decltype(auto)at(T&w,pl a,const source_location&l=source_location::current()){ return at(w,a.fi,a.se,l); } #else templateinline decltype(auto)at(T&w,auto&&a){return w[a];} templateinline decltype(auto)at(T&w,auto&&a,auto&&b){return w[a][b];} templateinline decltype(auto)at(T&w,auto&&a,auto&&b,auto&&c){return w[a][b][c];} templateinline decltype(auto)at(T&w,auto&&a,auto&&b,auto&&c,auto&&d){return w[a][b][c][d];} templateinline decltype(auto)at(T&w,pl a){return w[a.fi][a.se];} #endif #ifdef DEBUG #include #else #define show(...) #endif auto logic(){ ll N,K; cin>>N>>K; vectorg(K+1,1),h(K+1),nf(K+1,1); mint now=1; ll sign=-1; rep1(i,K){ now*=mint(i).inv(); at(g,i)=now*sign; sign=-sign; at(nf,i)=at(nf,i-1)*i; at(h,i)=mint(i).pow(N); at(h,i)*=at(nf,i).inv(); show("i",i,"nf",at(nf,i)); } auto f0=convolution(g,h); show("g",g); show("h",h); show("f0",f0); vectorodd(K+1); for(ll i=1;i<=K;i+=2){ at(odd,i)=mint(at(nf,i)).inv(); } auto f1=convolution(f0,odd); mint ans=at(f1,K)*at(nf,K); cout<>t; rep(i,t)logic(); //string a;rep(i,t)logic()?a+="Yes\n":a+="No\n";cout<