#include <bits/stdc++.h>
long long C[60][60];
void calC() {
  for (int i = 0; i < 60; i++) C[i][0] = C[i][i] = 1;
  for (int i = 1; i < 60; i++)
    for (int j = 1; j < i; j++) C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
}
int main() {
  calC();
  long long n, t;
  scanf("%I64d%I64d", &n, &t);
  n++;
  if (t & (t - 1)) {
    printf("0\n");
    return 0;
  }
  long long p = 1 + log2(t);
  long long ans = 0, res = p;
  for (int i = 60 - 1; i >= 0; i--)
    if (n & (1LL << i)) {
      ans += C[i][res];
      if (res == p && res == 1) ans--;
      res--;
      if (res < 0) break;
    }
  if (__builtin_popcount(n) == p) ans++;
  printf("%I64d\n", ans);
  return 0;
}
