#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; ll k; cin >> n >> k;
  int ans = 0;
  vector<ll> era;
  vector<pair<ll, int>> add;
  unordered_map<ll, int> dp{{1, 1}};
  for (int i = 2; i <= n; ++i) {
    for (auto [v, pat] : dp) {
      if (v * i > k) {
        era.emplace_back(v);
      } else {
        ans += pat;
        if (v * (i + 1) > k) {
          era.emplace_back(v);
        } else if (v * i * (i + 1) <= k) {
          add.emplace_back(v * i, pat);
        }
      }
    }
    for (ll e : era) dp.erase(e);
    era.clear();
    for (auto [v, pat] : add) dp[v] += pat;
    add.clear();
  }
  cout << ans * 2 + 1 << '\n';
  return 0;
}