#include <bits/stdc++.h>
const int INF = 2147483647;
const int INF2 = 0x3f3f3f3f;
const long long INF64 = (long long)4e18;
const double INFD = 1e30;
const double EPS = 1e-9;
const double PI = std::acos(-1);
const int MOD = 1e9 + 7;
template <typename T>
inline T read() {
  T X = 0, w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
  return w ? -X : X;
}
const int MAXN = 15;
const int MAXV = 1 << 20;
int n, m, k;
int dr[4] = {1, 0, -1, 0};
int dc[4] = {0, 1, 0, -1};
int dr2[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int dc2[8] = {1, 0, -1, 1, 0, -1, 1, -1};
int CASE = 1;
char S[MAXN];
int c[MAXN][MAXN];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    c[0][0] += 1 << n;
    for (int j = 0; j < n; j++) {
      for (int k = 0; k <= j; k++) {
        if (c[j][k] > 1 << n) {
          int f = (c[j][k] - (1 << n)) / 2;
          c[j + 1][k] += f;
          c[j + 1][k + 1] += f;
          c[j][k] = (1 << n);
        }
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      ans += (c[i][j] >= (1 << n));
    }
  }
  printf("%d\n", ans);
  return 0;
}
