#include <bits/stdc++.h>
using namespace std;
int dp1[13][13], dp2[13][13];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < k; i++) {
    memset(dp2, 0, sizeof(dp2));
    dp1[1][1] += 1024;
    if (dp1[1][1] > 1024) {
      dp2[1][1] = 1024;
      dp1[1][1] = 1024;
    }
    for (int j = 2; j <= n; j++) {
      for (int k = 1; k <= j; k++) {
        dp2[j][k] += dp2[j - 1][k] / 2 + dp2[j - 1][k - 1] / 2;
        dp1[j][k] += dp2[j][k];
        if (dp1[j][k] > 1024) {
          dp2[j][k] = dp1[j][k] - 1024;
          dp1[j][k] = 1024;
        } else
          dp2[j][k] = 0;
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++)
      if (dp1[i][j] == 1024) {
        ans++;
      }
  }
  printf("%d\n", ans);
  return 0;
}
