#include <bits/stdc++.h>
using namespace std;
long long dp[41][41];
void pre() {
  for (int i = 0; i < 41; ++i) dp[0][i] = 0;
  dp[0][0] = 1;
  for (int i = 1; i < 41; ++i) {
    dp[i][0] = dp[i - 1][0];
    for (int j = 1; j < 41; ++j) dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
  }
}
long long n, t, cur;
int findInd() {
  cur = 0;
  int ret = 0;
  for (int i = 0; i < 41; ++i) {
    cur += (1LL << i);
    if (cur > n) {
      cur -= (1LL << i);
      ret = i - 1;
      break;
    }
  }
  return ret;
}
void calc() {
  int po = 0;
  for (int i = 0; i < 41; ++i) {
    if ((1LL << i) == t) {
      po = i;
      break;
    }
  }
  int ind = findInd();
  long long ans = 0;
  for (int i = 0; i <= ind; ++i) {
    ans += dp[i][po];
  }
  if (po == 0) ans--;
  long long c = n - cur;
  while (c && ind >= 0 && po >= 0) {
    if (c >= (1LL << (ind))) {
      c -= (1LL << (ind));
      ans += dp[ind][po];
      ind--;
      po--;
    } else {
      ind--;
    }
  }
  cout << ans << endl;
}
int main() {
  cin >> n >> t;
  ++n;
  if ((t & (t - 1)) != 0) {
    cout << "0" << endl;
    return 0;
  }
  pre();
  calc();
  return 0;
}
