#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
const int maxn = 45;
long long comb[maxn][maxn];
int a[maxn];
int main() {
  long long t, n;
  cin >> n >> t;
  if (t & (t - 1)) printf("0\n"), exit(0);
  long long tt = t;
  int pp = 0;
  while (tt) ++pp, tt >>= 1;
  for (int i = 0; i < maxn; ++i) comb[i][0] = 1;
  for (int i = 1; i < maxn; ++i)
    for (int j = 1; j < maxn; ++j)
      comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];
  int len = 0;
  ++n;
  while (n) {
    a[len++] = n & 1;
    n >>= 1;
  }
  reverse(a, a + len);
  int has = 0;
  long long ans = 0;
  for (int i = 0; i < len; ++i) {
    if (a[i]) {
      int rem = pp - has;
      if (rem >= 0) ans += comb[len - i - 1][rem];
    }
    has += a[i];
  }
  if (has == pp) ++ans;
  if (pp == 1) ans--;
  cout << ans << endl;
  return 0;
}
