sieve.cpp

#include <bits/stdc++.h>

using namespace std;

#define MAINRET(x) in##x
#define what_is(x) cout << #x << " is " << x << endl;
#define LL long long
#define arr array<int,2>

void solve();

MAINRET(t) main(void) {
    std::cin.tie(nullptr);
    std::cin.sync_with_stdio(false);

        solve();
}

constexpr int INF = std::numeric_limits<int>::max() / 2;
constexpr int NINF = -INF;
constexpr LL MX = 3 * 1e5;
constexpr int MD = (int)1e9 + 7;

int n, m, k;

class SieveOfE {
public:
    vector<int> is_p;
    vector<int> primes;
    SieveOfE(int LIM) {
        is_p = vector<int>(LIM+10, true);
        is_p[0] = is_p[1] = false;
        for (int i = 2; i*i <= LIM; i++) {
            if (is_p[i]) {
                for (int j = i*i; j <= LIM; j += i) {
                    is_p[j] = false;
                }
            }
        }
        for (int i = 2; i <= LIM; i++) {
            if (is_p[i]) primes.push_back(i);
        }
    }
};

void solve() {
    constexpr int LIM = (int)1e5;
    SieveOfE sieve(LIM);
    return;
}

/*

*/