【Codeforces Round #457 (Div. 2) C】Jamie and Interesting Graph

#include <bits/stdc++.h>
#define ll long long
using namespace std;

int n,m,ma;

bool is(int x){
    if (x<2) return false;
    int len = sqrt(x);
    for (int i = 2;i <= len;i++){
        if (x%i==0)
            return false;
    }
    return true;
}

int main(){
    #ifdef LOCAL_DEFINE
        freopen("rush_in.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(0),cin.tie(0);
    cin >> n >> m;
    for (int i = n-1;;i++)
        if (is(i)){
            ma = i;
            break;
        }
    cout <<ma<<' '<<ma<<endl;
    for (int i = 1;i <= n-2;i++){
        cout <<i<<' '<<i+1<<" 1"<<endl;
    }
    cout <<n-1<<" "<<n<<" "<<ma-(n-2)<<endl;
    int now = n-1;
    for (int i = 1;i <= n &&now<m;i++)
        for (int j = i+1;j <= n && now <m;j++){
            if (j != (i+1)){
                cout <<i<<" "<<j<<" "<<ma+1<<endl;
                now++;
            }
        }
    return 0;
}