#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int nx8[] = {1, 1, -1, -1, 2, 2, -2, -2};
int ny8[] = {2, -2, 2, -2, 1, -1, 1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n, t, a[12][1026], p[12][1026], l[12];
int main() {
  scanf("%d %d", &n, &t);
  l[1] = 1;
  for (int i = 2; i <= n; i++) l[i] = l[i - 1] * 2;
  if (t == 0)
    printf("0");
  else {
    p[1][1] = 1;
    for (int i = 2; i <= t; i++) {
      p[1][1]++;
      for (int j = 1; j <= n; j++) {
        for (int k = 1; k <= j; k++) {
          if (p[j][k] >= l[j]) {
            int tmp = p[j][k] - l[j];
            p[j + 1][k] += tmp;
            p[j + 1][k + 1] += tmp;
          }
          if (p[j][k] >= l[j]) p[j][k] = l[j];
        }
      }
      p[1][1] = 1;
    }
    int res = 0;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= i; j++)
        if (p[i][j] >= l[i]) res++;
    printf("%d", res);
  }
  return 0;
}
