func_code_string: #include <bits/stdc++.h>   using namespace std;   const int mod = 998244353;   int n, k, limit, f[1010][1 << 2][2010], sta[1 << 2], ans;   int main() {     scanf( %d%d , &n, &k);     limit = (1 << 2) - 1;     sta[0] = 1;     sta[1] = 2;     sta[2] = 2;     sta[3] = 1;     for (int i = 0; i <= 3; i++) f[1][i][sta[i]] = 1;     for (int i = 1; i < n; i++)       for (int j = 0; j <= limit; j++)         for (int l = 1; l <= k; l++)           if (f[i][j][l]) {             for (int p = 0; p <= limit; p++) {               int temp = sta[p];               if (((p >> 0 & 1) == (j >> 0 & 1))) temp--;               if ((p >> 1 & 1) == (j >> 1 & 1)) temp--;               temp = max(0, temp);               f[i + 1][p][l + temp] = (f[i + 1][p][l + temp] + f[i][j][l]) % mod;             }           }     for (int i = 0; i <= limit; i++) ans = (ans + f[n][i][k]) % mod;     printf( %d n , ans);     return 0;   }   