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

struct ab{int a; int b;};
bool cmp(ab A, ab B){
    int Asum = A.a + A.b;
    int Bsum = B.a + B.b;
    return Asum < Bsum;
}

// (K-1)を引いた状態でとりあえず解を作る

int main() {
    int N, K;
    cin >> N >> K;
    vector<ab>ans;

    // [1, 2N]から生成
    int L = 1;
    int R;
    while (L <= N){
        R = 2*N - L/2;
        ans.push_back({L, R});
        L += 2;
    }
    L = 2;
    R--;
    while (L <= N){
        ans.push_back({L, R});
        R--;
        L += 2;
    }

    sort(ans.begin(), ans.end(), cmp);

    int min = ans[0].a + ans[0].b;
    min += (K - 1) * 2;
    if((K + 2*N) < min){
        cout << -1 << "\n";
        return 0;
    }

    for (int i = 0; i < N; ++i) {
        int a = ans[i].a + K - 1;
        int b = ans[i].b + K - 1;
        cout << a << " ";
        cout << b << " ";
        cout << K + 2*N + i << "\n";
    }
    return 0;
}