#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:200000000")
using namespace std;
template <typename T>
inline T Abs(T x) {
  return (x >= 0) ? x : -x;
}
template <typename T>
inline T sqr(T x) {
  return x * x;
}
template <typename T>
string toStr(T x) {
  stringstream st;
  st << x;
  string s;
  st >> s;
  return s;
}
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const long double EPS = 1E-9;
const long double PI = 3.1415926535897932384626433832795;
map<pair<long long, long long>, long long> d;
long long solve(long long n, long long t) {
  if (d.count(make_pair(n, t))) return d[make_pair(n, t)];
  if (n == 0) return d[make_pair(n, t)] = 0;
  long long l = 1, p = 0;
  while (2 * l <= n) {
    l *= 2;
    p++;
  }
  if (t == 1) return d[make_pair(n, t)] = p + 1;
  if (n <= 2) return d[make_pair(n, t)] = 0;
  long long ans = solve(l / 2 - 1, t);
  if (t % 2 == 0) ans += solve(l / 2 - 1, t / 2);
  if (n != l && t % 2 == 0) ans += solve(n - l, t / 2);
  return d[make_pair(n, t)] = ans;
}
int main() {
  long long n, t;
  cin >> n >> t;
  long long ans = solve(n + 1, t);
  if (t == 1) ans--;
  cout << ans << endl;
  return 0;
}
