#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<vector>

 using namespace std;

 #define fi first

 #define se second

 #define mp make_pair

 #define pb push_back

 typedef long long ll;

 typedef unsigned long long ull;

 typedef pair<int,int> pi;

 struct E

 {

     int u,v,w;

 }e[];

 int ne;

 int n,m;

 bool nprime[];

 int prime[],len;

 int x=,y=;

 int main()

 {

     int i,j,t;

     nprime[]=;

     for(i=;i<=;i++)

     {

         if(!nprime[i])    prime[++len]=i;

         for(j=;j<=len&&i*prime[j]<=;j++)

         {

             nprime[i*prime[j]]=;

             if(i%prime[j]==)    break;

         }

     }

     scanf("%d%d",&n,&m);m-=(n-);

     for(i=;i<n;i++)    e[++ne]=(E){i,i+,};

     for(i=;i<=m;i++)

     {

         if(y==n)    x++,y=x+;

         else    y++;

         e[++ne]=(E){x,y,};

     }

     for(t=;nprime[t+n-];t++);

     e[].w+=t;

     printf("%d %d\n",t+n-,t+n-);

     for(i=;i<=ne;i++)    printf("%d %d %d\n",e[i].u,e[i].v,e[i].w);

     return ;

 }