#include <bits/stdc++.h>
using namespace std;
long long n, t;
long long c[60][60];
long long solve(int logn, long long n, int k, int can) {
  if (k < 0) return 0;
  if (logn == 1) return can && (k == 0 || (k == 1 && n == 2));
  if ((1LL << (logn - 1)) >= n) return solve(logn - 1, n, k, 1);
  return c[logn - 1][k] + solve(logn - 1, n - (1LL << (logn - 1)), k - 1, 0);
}
int main() {
  c[1][0] = c[1][1] = 1;
  for (int i = 2; i < 60; i++) {
    for (int j = 1; j <= i; j++) c[i][j] += c[i - 1][j - 1];
    c[i][2]--;
    c[i][0]++;
    for (int j = 0; j <= i; j++) c[i][j] += c[i - 1][j];
  }
  cin >> n >> t;
  if (t & (t - 1)) {
    puts("0");
    return 0;
  }
  int k = 0;
  for (; (1LL << k) < t; k++)
    ;
  cout << solve(50, n, k, 1) << endl;
  return 0;
}
