#include <bits/stdc++.h>

namespace DECLARATIONS {
  using namespace std;

  using ll = long long;
  using PI = pair<int, int>;
  template<class T> using V = vector<T>;
  using VI = V<int>;
#define _1 first
#define _2 second

#ifdef MY_DEBUG
# define DEBUG(x) x
#else
# define DEBUG(x)
#endif

  template<class T>
  inline void debug(T &A) {
    DEBUG(
        for (const auto &a : A) {
          cerr << a << " ";
        }
        cerr << '\n';
    )
  }

  template<class T>
  inline void debug_dim2(T &A) {
    DEBUG(
        for (const auto &as : A) {
          debug(as);
        }
    )
  }

  template<typename ... Args>
  inline void debug(const char *format, Args const &... args) {
    DEBUG(
        fprintf(stderr, format, args ...);
        cerr << '\n';
    )
  }

  template<typename ... Args>
  string format(const std::string &fmt, Args ... args) {
    size_t len = std::snprintf(nullptr, 0, fmt.c_str(), args ...);
    std::vector<char> buf(len + 1);
    std::snprintf(&buf[0], len + 1, fmt.c_str(), args ...);
    return std::string(&buf[0], &buf[0] + len);
  }
}
using namespace DECLARATIONS;

const int MOD = 1000000007;
class UnionFind {
public:
  VI p;
  VI rank;

  UnionFind(int n): p(n), rank(n, 1) {
    for (int i = 0; i < n; ++i) {
      p[i] = i;
    }
  }

  int unite(int x, int y) {
    int idx = find(x), idy = find(y);
    if (idx == idy) return idx;

    auto merge = [&](int nd, int rt) {
      rank[rt] += rank[nd];
      p[nd] = rt;
      return rt;
    };

    return rank[idx] < rank[idy] ? merge(idx, idy) : merge(idy, idx);
  }

  int find(int x) {
    return p[x] == x ? x : find(p[x]);
  }

  bool same(int x, int y) {
    return find(x) == find(y);
  }

  int count_connected(int x) {
    return rank[find(x)];
  }
};

int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int N, P;
  cin >> N >> P;

  UnionFind uf(N + 1);
  for (int i = 2; i <= N; ++i) {
    int j = i;
    while(j + i <= N) {
      uf.unite(j, j + i);
      j += i;
    }
  }
  cout << uf.count_connected(P);

  return 0;
}