#include <bits/stdc++.h>
using namespace std;
long long n, t, now, tmp, i, j, mul;
long long cnt[60][60];
long long ans[60];
int main() {
  cin >> n >> t;
  n++;
  memset(cnt, 0, sizeof(cnt));
  cnt[0][0] = 1;
  for (i = 1; i <= 50; i++) {
    memcpy(cnt[i], cnt[i - 1], sizeof(cnt[i]));
    for (j = 1; j < 60; j++) cnt[i][j] += cnt[i - 1][j - 1];
  }
  tmp = 1;
  now = n;
  memset(ans, 0, sizeof(ans));
  for (i = 0;; i++) {
    if (now >= tmp) {
      now -= tmp;
      for (j = 0; j < 60; j++) ans[j] += cnt[i][j];
    } else {
      mul = 0;
      break;
    }
    tmp *= 2;
  }
  i--;
  tmp /= 2;
  while (now > 0) {
    if (now >= tmp) {
      now -= tmp;
      for (j = mul; j < 60; j++) ans[j] += cnt[i][j - mul];
      mul++;
    }
    i--;
    tmp /= 2;
  }
  tmp = 0;
  while (t % 2 == 0) {
    tmp++;
    t /= 2;
  }
  if (t == 1) {
    if (tmp == 0) ans[tmp]--;
    cout << ans[tmp] << endl;
  } else
    cout << 0 << endl;
}
