#include <bits/stdc++.h>
using namespace std;
long long n, t;
long long dp[4][4][8];
long long A[8][5][2];
void init() {
  for (long long j = 1; j < 4; j++) {
    memset(A, 0, sizeof A);
    A[0][j][0] = 1;
    for (long long i = j + 1; i <= 4; i++) A[1][i][0] = 1;
    for (long long i = 2; i <= 6; i++) {
      for (long long k = 1; k <= 4; k++) {
        for (long long z = 1; z <= 4; z++) {
          if (k < z) {
            A[i][k][1] += (A[i - 1][z][0] + A[i - 1][z][1]);
          } else if (k > z) {
            A[i][k][0] += (A[i - 1][z][0]);
          }
        }
        dp[j][k][i] = A[i][k][1];
      }
    }
  }
}
vector<long long> v;
long long ans = 0;
void cal(long long n, long long val, long long p) {
  if (n == v.size()) {
    ans += val;
    return;
  }
  for (long long i = 1; i <= 3; i++) {
    long long x = val * dp[p][i][v[n]];
    if (x == 0) return;
    cal(n + 1, x, i);
  }
}
void dfs(long long n, long long t) {
  if (t == 0) {
    for (long long i = 1; i <= 3; i++) cal(0, 1, i);
    return;
  }
  for (long long i = 2; i <= min(n, 6ll); i++) {
    if (n - i > 6 * (t - 1))
      ;
    else if (n - i < 2 * (t - 1))
      ;
    else {
      v.push_back(i);
      dfs(n - i, t - 1);
      v.pop_back();
    }
  }
}
signed main() {
  scanf("%lld", &(n));
  scanf("%lld", &(t));
  if (n < 1 + t * 2) {
    cout << 0 << '\n';
    return 0;
  }
  if (n > 1 + t * 6) {
    cout << 0 << '\n';
    return 0;
  }
  init();
  n -= 1;
  dfs(n, t);
  cout << ans << '\n';
}
