#include <bits/stdc++.h>
using namespace std;
long long n, t;
long long dp[55][55];
long long solve(long long n, int p) {
  if (p == 0) return 1;
  for (int i = 50; i >= 0; --i) {
    if ((1ll << i) & n) {
      return dp[i][p] + solve(n - (1ll << i), p - 1);
    }
  }
  return 0;
}
int main(void) {
  dp[0][0] = 1;
  for (int i = 0; i < 50; ++i) {
    for (int j = 0; j < 50; ++j) {
      dp[i + 1][j] = dp[i][j] + (j >= 1 ? dp[i][j - 1] : 0);
    }
  }
  cin >> n >> t;
  ++n;
  int p = 0;
  while (1ll << p < t) ++p;
  if (1ll << p != t) {
    printf("0\n");
    return 0;
  }
  ++p;
  cout << solve(n, p) - (t == 1 ? 1 : 0) << endl;
  return 0;
}
