#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
vi fast_mod_convolution(vi&a,vi&b,ll mod){
  const ll m1=167772161,m2=469762049,m3=1224736769;
  const ll m1_inv_m2=inv_mod(m1,m2);
  const ll m12_inv_m3=inv_mod(m1*m2,m3);
  const ll m12_mod=m1*m2%mod;
  auto x=convolution<m1>(a,b);
  auto y=convolution<m2>(a,b);
  auto z=convolution<m3>(a,b);
  vector<ll>ret(sz(a)+sz(b)-1);
  REP(i,sz(ret)){
    ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;
    ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;
  	ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;
  }
  return ret;
}
const ld EPS=1e-8;
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
int main(){
  ll N,K;cin>>N>>K;
  vm F(10*K);
  F[1]=1;
  FOR(i,2,10*K)F[i]=F[i-1]+F[i-2];
  REP(i,10*K)F[i]=F[i].pow(K);
  
  vvm A(2*K,vm(4*K));
  REP(i,2*K)REP(j,2*K)A[i][j]=F[i+j];
  REP(i,2*K)A[i][i+2*K]=1;
  REP(i,2*K){
  	ll t=i;
  	while(t<2*K&&!A[t][i].val())t++;
  	if(t==2*K)break;
  	swap(A[t],A[i]);
  	FOR(j,i+1,4*K)A[i][j]/=A[i][i];
  	A[i][i]=1;
  	REP(j,2*K)if(j!=i){
  		mint c=A[j][i];
  		FOR(l,i,4*K)A[j][l]-=A[i][l]*c;
  	}
  }
  
  vm coeff(2*K);
  REP(i,2*K)REP(j,2*K)coeff[i]+=A[i][j+2*K]*F[2*K+j];
  
  vvm B(2*K,vm(2*K));
  REP(i,2*K-1)B[i][i+1]=1;
  REP(i,2*K)B[2*K-1][i]=coeff[i];
  
  auto f=[&](vvm x,vvm y){
  	vvm z(2*K,vm(2*K));
  	REP(i,2*K)REP(j,2*K)REP(k,2*K)z[i][j]+=x[i][k]*y[k][j];
  	return z;
  };
  
  vvvm T(60,vvm(2*K,vm(2*K))),S(60,vvm(2*K,vm(2*K)));
  T[0]=B;
  FOR(i,1,60)T[i]=f(T[i-1],T[i-1]);
  REP(i,2*K)S[0][i][i]=1;
  FOR(i,1,60){
  	auto nex=f(S[i-1],T[i-1]);
  	REP(j,2*K)REP(k,2*K)S[i][j][k]=S[i-1][j][k]+nex[j][k];
  }
  N++;
  vvm ans(2*K,vm(2*K));
  REP(i,60)if((N>>i)%2){
  	auto nex=f(ans,T[i]);
  	REP(j,2*K)REP(k,2*K)ans[j][k]=nex[j][k]+S[i][j][k];
  }
  mint sum=0;
  REP(i,2*K)sum+=F[i]*ans[0][i];
  cout<<sum<<endl;
  return 0;
}