#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};





combi C(1000000);


int main(){
	
	int N,K;
	cin>>N>>K;
	
	vector<mint> t(K+1,0);
	vector<mint> x(K+1,0);
	rep(i,K+1){
		t[i] = mint(i).pow(N);
		t[i] *= C.kaijou_[i];
		x[i] = C.kaijou_[i];
		if(i%2==1)x[i] *= -1;
	}
	t = convolution(t,x);
	rep(i,t.size())t[i] *= C.kaijou[i];
	mint ans = 0;
	
	for(int i=1;i<=K;i++){
		if((K-i)%2==0)continue;
		ans += t[i] * C.combination(K,i);
	}
	
	cout<<ans.val()<<endl;
	
	return 0;
}