#include <bits/stdc++.h>
using namespace std;
map<pair<long long, int>, long long> mp;
long long func(long long n, int x) {
  pair<long long, int> p = make_pair(n, x);
  if (mp.find(p) != mp.end()) return mp[p];
  if (n == 0) return mp[p] = 0;
  if (n == 1) return mp[p] = ((x == 0) ? 1 : 0);
  long long ans = 0;
  ans += func((n + 1) / 2, x);
  if (x != 0) ans += func(n / 2, x - 1);
  return mp[p] = ans;
}
int main(void) {
  long long n, t;
  int i;
  cin >> n >> t;
  for ((i) = 0; (i) < (int)(50); (i)++)
    if (t == (1ll << i)) {
      long long ans = func(n + 2, i + 1) - func(2, i + 1);
      cout << ans << endl;
      return 0;
    }
  cout << 0 << endl;
  return 0;
}
