#include using namespace std; #define inf INT_MAX #define INF LLONG_MAX #define ll long long #define ull unsigned long long #define M (int)(1e9+7) #define P pair #define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++) #define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--) #define rep(i,n) FOR(i,0,n) #define rrep(i,n) RFOR(i,n,0) #define all(a) a.begin(),a.end() const int vx[4] = {0,1,0,-1}; const int vy[4] = {1,0,-1,0}; #define F first #define S second #define PB push_back #define EB emplace_back #define int ll #define vi vector #define IP pair #define PI pair #define PP pair #define Yes(f){cout<<(f?"Yes":"No")< par; vector sizes; UnionFind(int n) : par(n), sizes(n, 1) { rep(i,n) par[i] = i; } int root(int x) { if (x == par[x]) return x; return par[x] = root(par[x]); } bool unite(int x, int y) { x = root(x); y = root(y); if (x == y) return false; if (sizes[x] < sizes[y]) swap(x, y); par[y] = x; sizes[x] += sizes[y]; return true; } bool find(int x,int y){ return root(x)==root(y); } int size(int x) { return sizes[root(x)]; } }; signed main(){ cin.tie(0); ios::sync_with_stdio(false); cout<>n>>k; UnionFind uf(n+1); bool b[1100000]={}; FOR(i,2,n+1){ if(b[i]) continue; b[i]=true; for(int j=i;j<=n;j+=i){ uf.unite(i,j); } } cout<