#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using mint = atcoder::modint998244353;

#define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++)
#define ll long long

int main() {
    ll N; int K; cin >> N >> K;
    if (N > 100000) return 0;
    vector<mint> F(N+1);
    F[1] = F[2] = 1;
    rep(i, 3, N+1) F[i] = F[i-1] + F[i-2];
    mint ans = 0;
    rep(i, 1, N+1) ans += F[i].pow(K);
    cout << ans.val() << endl;
}