#include <bits/stdc++.h>
using namespace std;
long long int isPrime(long long int n) {
  long long int i, root;
  if (n % 2 == 0 || n % 3 == 0) return 0;
  root = (long long int)sqrt(n);
  for (i = 5; i <= root; i += 6) {
    if (n % i == 0) return 0;
  }
  for (i = 7; i <= root; i += 6) {
    if (n % i == 0) return 0;
  }
  return 1;
}
long long int find_prime(long long int n) {
  while (isPrime(n) == 0) n++;
  return n;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin.tie(NULL);
  long long int n, m, i, j, k;
  cin >> n >> m;
  if (n == 2) {
    cout << "100003 100003" << endl << "1 2 100003" << endl;
    exit(0);
  }
  if (n == 3 && m == 2) {
    cout << "100003 100003" << endl << "1 2 100002" << endl << "2 3 1" << endl;
    exit(0);
  }
  if (n == 3) {
    cout << "100003 100003" << endl
         << "1 2 100002" << endl
         << "2 3 1" << endl
         << "1 3 1000000000" << endl;
    exit(0);
  }
  long long int prime = find_prime(n + 2);
  cout << "2 " << prime << endl;
  cout << "1 3 1" << endl << "3 " << n << " 1" << endl;
  m -= 2;
  for (i = 4; i < n && m > 0; i++, m--) cout << "1 " << i << " 1" << endl;
  cout << "1 2 " << prime - n + 2 << endl;
  m -= 1;
  for (i = 2; i < n; i++) {
    for (j = i + 1; j <= n && m > 0; j++) {
      if (i != 3 || j != n) {
        cout << i << " " << j << " 1000000000" << endl;
        m--;
      }
    }
  }
  if (m > 0) cout << "1 " << n << " 100000000" << endl;
  return 0;
}
