#include <bits/stdc++.h>
using namespace std;
long long n, t, res = 0;
stack<long long> s;
long long c[50][50];
void preprocess() {
  memset(c, sizeof(c), 0);
  c[0][0] = c[1][0] = c[1][1] = 1;
  for (long long i = 2; i < 50; ++i) {
    c[i][0] = 1;
    for (long long j = 1; j < i; ++j) c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
    c[i][i] = 1;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  preprocess();
  cin >> n >> t;
  ++n;
  long long p = 1, d = 1;
  while (p < t) p *= 2, ++d;
  if (p != t) {
    cout << "0";
    return 0;
  }
  p = n;
  while (p > 0) {
    s.push(p & 1);
    p /= 2;
  }
  long long m = s.size();
  while (!s.empty()) {
    long long dg = s.top();
    s.pop();
    if (d == 0) break;
    if (dg) res += c[s.size()][d--];
  }
  if (d == 0) ++res;
  if (t == 1) --res;
  cout << res;
}
