#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
map<pair<long long, int>, long long> memo;
long long solve(long long n, int x) {
  pair<long long, int> p = make_pair(n, x);
  if (memo.find(p) != memo.end()) return memo[p];
  if (n == 0) return memo[p] = 0;
  if (n == 1) return memo[p] = (x == 0) ? 1 : 0;
  return memo[p] = solve((n + 1) / 2, x) + (x ? solve(n / 2, x - 1) : 0);
}
int main() {
  ios_base::sync_with_stdio(false);
  long long n, t;
  cin >> n >> t;
  for (int i = 0; (1ll << i) <= t; ++i)
    if (t == (1ll << i)) {
      cout << solve(n + 2, i + 1) - solve(2, i + 1);
      return 0;
    }
  cout << 0;
  return 0;
}
