#include <bits/stdc++.h>
using namespace std;
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
  os << "(";
  os << v.first << "," << v.second << ")";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[";
  long long sz = v.size();
  for (long long i = 0; i < sz; ++i) {
    os << v[i];
    if (i != sz - 1) os << ",";
  }
  os << "]\n";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  T last = *v.rbegin();
  os << "[";
  for (auto it : v) {
    os << it;
    if (it != last) os << ",";
  }
  os << "]\n";
  return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
  for (auto it : v) {
    os << it.first << " : " << it.second << "\n";
  }
  return os;
}
long long power(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b % 2) {
      res = (res * a) % 1000000007;
    }
    b /= 2;
    a = (a * a) % 1000000007;
  }
  return res;
}
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const long long N = 1e6 + 5;
long long is[N];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  for (__typeof(2) i = 2; i <= N - 1; i++) is[i] = 1;
  for (__typeof(2) i = 2; i <= N - 1; i++)
    if (is[i]) {
      for (long long j = 1ll * i * i; j < N; j += i) is[j] = 0;
    }
  long long prime = n;
  while (!is[prime]) ++prime;
  vector<pair<pair<long long, long long>, long long> > edges;
  for (__typeof(1) i = 1; i <= n - 1; i++) {
    long long w = (i == n - 1) ? (prime - n + 2) : 1;
    edges.push_back({{i, i + 1}, w});
  }
  m -= (n - 1);
  for (long long i = 1; i <= n; ++i) {
    for (long long j = i + 2; j <= n; ++j) {
      if (m == 0) break;
      edges.push_back({{i, j}, prime + 100});
      m--;
    }
    if (m == 0) break;
  }
  cout << prime << " " << prime << endl;
  for (auto elem : edges) {
    cout << elem.first.first << " " << elem.first.second << " " << elem.second
         << endl;
  }
  return 0;
}
