#include <iostream>

using namespace std;

const int dxh[] = {-2, -2, 2, 2, -1, -1, 1, 1};
const int dyh[] = {-1, 1, -1, 1, -2, 2, -2, 2};

bool in(int i, int j, int n, int m)
{
    return i >= 1 && i <= n && j >= 1 && j <= m;
}

int dp[111][111][111];

int main()
{
    int n, k;
    cin >> n >> k;
    dp[0][n][1] = 1;

    for(int cnt = 0; cnt < k; cnt++)
    {
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
            {
                for(int dir = 0; dir < 8; dir++)
                {
                    int ni = i + dxh[dir];
                    int nj = j + dyh[dir];
                    if(in(ni, nj, n, n))
                    {
                        dp[cnt + 1][ni][nj] += dp[cnt][i][j];
                    }
                }
            }
    }

    cout << dp[k][1][n] << endl;
    return 0;
}