#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, t;
  cin >> n >> t;
  int d = 1;
  while (t > 1) {
    if (t % 2) {
      cout << 0 << endl;
      return 0;
    }
    t /= 2;
    d++;
  }
  long long dp[60][60] = {};
  dp[1][1] = 1;
  long long cur = 1;
  long long lv = 1;
  long long ans = 0;
  int i = 2;
  n++;
  for (i = 2; i <= 60; i++) {
    for (int j = 1; j <= i; j++) {
      dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
    }
    lv *= 2;
    cur += lv;
    if (cur > n) break;
    ans += dp[i][d];
  }
  n -= lv - 1;
  while (lv > 1) {
    lv /= 2;
    i--;
    if (n >= lv) {
      ans += dp[i][d];
      n -= lv;
      d--;
    }
  }
  cout << ans << endl;
  return 0;
}
