#include <bits/stdc++.h>
using namespace std;
map<pair<long long int, int>, long long int> memo;
map<pair<long long int, int>, long long int> visitado;
long long int f(long long int n, long long int e) {
  if (n == 0 && e == 0) return 1;
  if (n == 0) return 0;
  if (e == 1 && n == 1) return 1;
  if (e == 0) return 1;
  if (visitado[make_pair(n, e)] == 1) return memo[make_pair(n, e)];
  visitado[make_pair(n, e)] = 1;
  return memo[make_pair(n, e)] = f((n - 1) / 2, e - 1) + f(n / 2, e);
}
int main() {
  long long int n, t;
  scanf("%I64d%I64d", &n, &t);
  n++;
  int e = 0;
  while (t > 1) {
    if (t % 2 == 0) {
      t /= 2;
      e++;
    } else {
      e = -1;
      t = 1;
    }
  }
  if (e == -1)
    printf("0\n");
  else {
    long long int resp = f(n, e + 1);
    if (e == 0) resp--;
    printf("%I64d\n", resp);
  }
  return 0;
}
