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

int main() {
    int n, k; cin >> n >> k;
    vector<pair<int, pair<int, int>>> d;
    vector<int> a(n), b(n), c(n);
    for (int i = 0; i < n/2; i++) {
        d.push_back({i+1, {i, i*2+1}});
        d.push_back({i-n/2, {i+n/2, i*2}});
    }
    if (n & 1) {
        d.push_back({0, {n-1, n-1}});
    }
    sort(d.begin(), d.end());
    for (int i = 0; i < n; i++) {
        auto u = n+k+i;
        auto p = d[i].second.first + k;
        auto q = d[i].second.second + k + n*2;
        if (u > q-p) {
            cout << -1 << endl;
            return 0;
        }
        a[i] = p;
        b[i] = u;
        c[i] = q;
    }
    for (int i = 0; i < n; i++) {
        cout << a[i] << " " << b[i] << " " << c[i] << endl;
    }
    return 0;
}