#include <bits/stdc++.h>
using namespace std;
long long int ncr(long long int n, long long int r) {
  if (r > n) return 0;
  if (n == r) return 1;
  if (r == 0) return 1;
  if (r == 1) return n;
  long long int ans = 1;
  for (long long int i = 1; i <= r; i++) {
    ans *= (n - i + 1);
    ans /= i;
  }
  return ans;
}
long long int solve(long long int n, long long int k) {
  if (k == 0) return 1;
  if (n == 1) {
    if (k >= 2) return 0;
    return k;
  }
  if (n == 0) return 0;
  long long int temp = 1, cnt = 0;
  while (2 * temp <= n) {
    cnt++;
    temp *= 2;
  }
  return ncr(cnt, k) + solve(n - temp, k - 1);
}
int main() {
  long long int i, j, n, t, cnt = 0, ans;
  cin >> n >> t;
  while (t % 2 == 0) {
    cnt++;
    t = t / 2;
  }
  if (t != 1) {
    cout << "0";
    return 0;
  }
  cnt++;
  ans = solve(n + 1, cnt);
  if (cnt == 1) ans--;
  cout << ans;
  return 0;
}
