#include <bits/stdc++.h>
using namespace std;
long long f[45][45];
int main() {
  long long i, j, n, t, tt;
  scanf("%I64d%I64d", &n, &t);
  for (tt = 0; t > 1; t >>= 1, tt++)
    if (t & 1) {
      printf("0\n");
      return 0;
    }
  for (i = 0; i <= 41; ++i) {
    f[i][0] = 1;
    for (j = 1; j <= i; ++j) f[i][j] = f[i - 1][j] + f[i - 1][j - 1];
  }
  long long ans = 0;
  for (i = 1; n - (1ll << i) >= 0; ++i) {
    ans += f[i][tt];
    n -= 1ll << i;
  }
  for (i--; i >= 0 && tt >= 0; --i)
    if (n >= (1ll << i)) {
      ans += f[i][tt--];
      n -= 1ll << i;
    }
  printf("%I64d\n", ans);
  return 0;
}
