#if !__INCLUDE_LEVEL__
    #include __FILE__

ll prime[] = {
    319927, 319937, 319973, 319993, 320011, 320107, 320119, 320143, 320153,
    320209, 320303, 320329, 320377, 320389, 320417, 320561, 320591, 320611,
    321091, 321143, 321169, 321301, 321313, 321323, 321331, 321359, 321467,
    321509, 321553, 321571, 321593, 321721, 321743, 321757, 321799, 321821,
    321949, 321983, 322001, 322013, 322039, 322139, 322171, 322213, 322237,
    322247, 322403, 322417, 322433, 322463,
};
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N, K;
    cin >> N >> K;
    ll delta = 200;
    vector<ll> T(N), U(N);
    REP(i, K) cin >> T[i];
    REP(i, K) cin >> U[i];

    REP(i, N) {
        cout << prime[i] << " " << 3 << " " << 5000 << "\n";
    }

    return 0;
}

//====================temp====================
#else
    #include <bits/stdc++.h>
using namespace std;
    #define REP(i, n) for (int i = 0; i < (int)(n); i++)
    #define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
    #define REPITR(itr, ARRAY) \
        for (auto itr = (ARRAY).begin(); itr != (ARRAY).end(); ++itr)
    #define RREPITR(itr, ARRAY) \
        for (auto itr = (ARRAY).rbegin(); itr != (ARRAY).rend(); ++itr)
    #define ALL(n) (n).begin(), (n).end()
using ll = long long;
using ull = unsigned long long;
//#define int long long
template<typename T> struct edge {
    int to;
    T cost;
    edge() {}
    edge(int to, T cost): to(to), cost(cost) {}
};
#endif