#include <bits/stdc++.h> #pragma GCC optimize("Ofast") using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=2167167167167167167; const int INF=2100000000; const ll mod=1e9+7; #define rep(i,a) for (int i=0;i<a;i++) #define all(p) p.begin(),p.end() template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>; template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;} template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());} template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";} template<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} //https://ei1333.github.io/library/other/xor-shift.cpp.html struct XorShift { private: constexpr static double R = 1.0 / 0xffffffff; uint64_t x; public: explicit XorShift(uint64_t seed = 88172645463325252ull) : x(seed) {} template< typename T = uint64_t > inline T get() { // [0, 2^64) x ^= x << 7ull; x ^= x >> 9ull; return x; } inline uint32_t get(uint32_t r) { // [0, r) return ((uint64_t) get< uint32_t >() * r) >> 32ull; } inline uint32_t get(uint32_t l, uint32_t r) { // [l, r) return l + get(r - l); } inline double probability() { // [0.0, 1.0] return get< uint32_t >() * R; } }; template<class T> void shuffle_vector(vector<T> &p,XorShift &table){ int L=p.size(); for(int i=0;i<L;i++){ int ind=table.get(i,L); swap(p[ind],p[i]); } return ; } //a以下の素数を列挙、計算量:Nlog(log(N)) vector<long long> Eratosthenes(long long a){ if(a<2) return {}; vector<long long> p(a+1),ans; p[0]=1,p[1]=1; long long k=2; while(k*k<=a){ if(p[k]==0){ ans.push_back(k); for(long long i=2;i*k<=a;i++){ p[i*k]=1; } } k++; } while(k<=a){ if(p[k]==0) ans.push_back(k); k++; } return ans; } void solve(); // oddloop int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; //cin>>t; rep(i,t) solve(); } void solve(){ XorShift table(167); auto E=Eratosthenes(1000); rep(i,50){ int B=E[i]+table.get(1,E[i]); int M=E[i]; cout<<B<<" "<<M<<" 167167\n"; } }