#include <bits/stdc++.h>

#define INF 0x3f3f3f3f

#define P (LL)(998244353)

typedef long long LL;

typedef long double ld;

typedef unsigned long long ULL;

using namespace std;

const int MAXN =  + ;

const int MAXK = MAXN << ;

int dp[MAXN][MAXK][][];

int modify[][][][];

void pre() {

    modify[][][][] = ; modify[][][][] = ; modify[][][][] = ; modify[][][][] = ;

    modify[][][][] = ; modify[][][][] = ; modify[][][][] = ; modify[][][][] = ;

    modify[][][][] = ; modify[][][][] = ; modify[][][][] = ; modify[][][][] = ;

    modify[][][][] = ; modify[][][][] = ; modify[][][][] = ; modify[][][][] = ;

}

int main() {

    int n , k;

    cin>>n>>k;

    pre();

    dp[][][][] = dp[][][][] = ;

    dp[][][][] = dp[][][][] = ;

    for(int i = ; i <= n; i++)

        for(int j = ; j <= k; j++)

            for(int a = ; a < ; a++)

                for(int b = ; b < ; b++)

                    for(int A = ; A < ; A++)

                        for(int B = ; B < ; B++) {

                            int block = modify[A][B][a][b];

                            if(j >= block) dp[i][j][a][b] = (dp[i][j][a][b] + dp[i - ][j - block][A][B]) % P;

                        }

    int ans = ;

        for(int A = ; A < ; A++)

            for(int B = ; B < ; B++)

                ans = (ans + dp[n][k][A][B]) % P;

    cout<<ans;

    return ;

}