#include <bits/stdc++.h>
long long cnt[100][100];
long long n, t, k;
long long go(long long rest, long long level, long long x) {
  if (level == 1) {
    if (rest == 1)
      return x == 0;
    else
      return x == 1;
  }
  if (rest > (1ll << (level - 1)))
    return go(rest - (1ll << (level - 1)), level - 1, x - 1) +
           cnt[level - 1][x];
  else
    return go(rest, level - 1, x);
}
int main() {
  cnt[1][0] = cnt[1][1] = 1;
  for (int i = 2; i <= 100; ++i) {
    for (int j = 0; j <= i; ++j) {
      cnt[i][j] += cnt[i - 1][j];
      if (j > 0) cnt[i][j] += cnt[i - 1][j - 1];
    }
  }
  scanf("%I64d %I64d", &n, &t);
  while (1ll << (k + 1) <= t) k++;
  if ((1ll << k) != t)
    printf("0");
  else {
    long long ans = 0;
    long long tot = 0, level = 1;
    while (tot + (1ll << level) <= n) {
      ans += cnt[level][k];
      tot += (1ll << level), level++;
    }
    ans += go(n - tot, level, k);
    printf("%I64d", ans);
  }
  return 0;
}
