#include <bits/stdc++.h>
using namespace std;
int ord2(long long k) {
  if (k == 0) return 0;
  int result = 0;
  while (k != 1) {
    if (k % 2 == 1) return -1;
    k /= 2;
    result++;
  }
  return result;
}
long long C(int n, int k) {
  if (k > n) return 0;
  long long result = 1;
  for (int i = 1; i <= k; i++) {
    result *= (n + 1 - i);
    result /= i;
  }
  return result;
}
long long count(long long n, int k) {
  long long result = 0;
  for (int bit = 55; bit >= 0; bit--) {
    if (k <= -1) break;
    long long pow2 = 1LL << bit;
    if (pow2 > n)
      continue;
    else {
      long long temp = C(bit, k);
      result += temp;
      n -= pow2;
      k--;
    }
  }
  if (k == 0) result++;
  return result;
}
long long solve(long long n, long long t) {
  int ord = ord2(t);
  if (ord == -1) return 0;
  int target = ord + 1;
  long long result = count(n + 1, target) - count(1, target);
  return result;
}
int main() {
  long long n, t;
  cin >> n >> t;
  cout << solve(n, t);
  return 0;
}
