// #pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

// hloya template v26
 
// ░░░░░░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░░░░░
// ░░░░░░█░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░█░░░░░
// ░░░░░░█░█░▀░░░░░▀░░▀░░░░█░█░░░░░
// ░░░░░░█░█░░░░░░░░▄▀▀▄░▀░█░█▄▀▀▄░
// █▀▀█▄░█░█░░▀░░░░░█░░░▀▄▄█▄▀░░░█░
// ▀▄▄░▀██░█▄░▀░░░▄▄▀░░░░░░░░░░░░▀▄
// ░░▀█▄▄█░█░░░░▄░░█░░░▄█░░░▄░▄█░░█
// ░░░░░▀█░▀▄▀░░░░░█░██░▄░░▄░░▄░███
// ░░░░░▄█▄░░▀▀▀▀▀▀▀▀▄░░▀▀▀▀▀▀▀░▄▀░
// ░░░░█░░▄█▀█▀▀█▀▀▀▀▀▀█▀▀█▀█▀▀█░░░
// ░░░░▀▀▀▀░░▀▀▀░░░░░░░░▀▀▀░░▀▀░░░░

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

bool dbg = 0;
  
clock_t start_time = clock();
#define current_time fixed<<setprecision(6)<<(ld)(clock()-start_time)/CLOCKS_PER_SEC
  
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define sqr(x) ((x) * (x))


#define ull unsigned long long
#define ll long long
#define ld long double
#define pii pair<int,int>
#define umap unordered_map<int, int>
  
#define files1 freopen("input.txt","r",stdin)
#define files2 freopen("blackjack.out","w",stdout)
#define files files1;files2
#define fast_io ios_base::sync_with_stdio(0);cin.tie(0)
  
#define endl '\n'
#define ln(i,n) " \n"[(i) == (n) - 1]
  
void bad(string mes = "Impossible"){cout << mes;exit(0);}
void bad(int mes){cout << mes;exit(0);}
  
template<typename T>
string bin(T x, int st = 2){
    string ans = "";
    while (x > 0){
        ans += char('0' + x % st);
        x /= st;
    }
    reverse(ans.begin(), ans.end());
    return ans.empty() ? "0" : ans;
}
  
mt19937_64 mt_rand(
    chrono::system_clock::now().time_since_epoch().count()
);

template<typename T1, typename T2> inline bool upmax(T1& a, T2 b) { return (a < b ? (a = b, true) : false); }
template<typename T1, typename T2> inline bool upmin(T1& a, T2 b) { return (b < a ? (a = b, true) : false); }

// inline int popcount(int x){
//     int count = 0;
//     __asm__ volatile("POPCNT %1, %0;":"=r"(count):"r"(x):);
//     return count;
// }
  
// template<typename T>
// T input(){
//     T ans = 0, m = 1;
//     char c = ' ';
  
//     while (!((c >= '0' && c <= '9') || c == '-')) {
//         c = getchar();
//     }
  
//     if (c == '-')
//         m = -1, c = getchar();
//     while (c >= '0' && c <= '9'){
//         ans = ans * 10 + (c - '0'), c = getchar();
//     }
//     return ans * m;
// }

template<typename T>
T gcd (T a, T b) { while (b) { a %= b; swap (a, b); } return a; }
  
// template<typename T> void read(T& a) { a = input<T>(); }
// template<typename T> void read(T& a, T& b) { read(a), read(b); }
// template<typename T> void read(T& a, T& b, T& c) { read(a, b), read(c); }
// template<typename T> void read(T& a, T& b, T& c, T& d) { read(a, b), read(c, d); }
  
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)1e6 + 3, base = (int) 1e9+2012;
const ll llinf = 2e18 + 5;

bool solve() {
    // ifstream cin("input.txt");
    int n, k;
    cin >> n >> k;

    vector<int> a, b, c;
    for (int i = 0; i < n; i++) {
        a.pb(k + i);
        b.pb(k + i + n);
        c.pb(k + i + n + n);
    }

    if (k > (n + 1) / 2) {
        cout << -1;
        return 0;
    }

    int pos = n / 2;

    vector<pair<int, int>> semires;
    vector<int> usa(n, 0), usb(n, 0);
    int pos2 = n - 1;
    for (int i = n - 1; pos >= 0; i--) {
        semires.eb(a[pos], b[pos2]);
        usa[pos] = 1;
        usb[pos2] = 1;
        pos--;
        pos2--;
    }

    vector<int> resa, resb;
    for (int i = 0; i < n; i++) {
        if (!usa[i]) {
            resa.pb(a[i]);
        }
        if (!usb[i]) {
            resb.pb(b[i]);
        }
    }
    for (int i = 0; i < resa.size(); i++) {
        semires.eb(resa[i], resb[i]);
    }

    sort(all(semires), [](auto x, auto y){return x.f + x.s < y.f + y.s;});
    assert(semires.size() == n);

    vector<tuple<int, int, int>> res;
    for (int i = 0; i < n; i++) {
        res.eb(semires[i].f, semires[i].s, c[i]);
    }

    for (auto x : res) {
        int a, b, c;
        tie(a, b, c) = x;
        cout << a << ' ' << b << ' ' << c << "\n";
    }
    return true;
}

bool brute(){
    ifstream cin("input.txt");

    int n, k;
    cin >> n >> k;

    vector<int> a, b, c;
    for (int i = 0; i < n; i++) {
        a.pb(k + i);
        b.pb(k + i + n);
        c.pb(k + i + n + n);
    }
    do {
        sort(all(b));
        do {
            bool ok = true;
            for (int i = 0; i < a.size(); i++) {
                if (a[i] + b[i] > c[i]) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                return true;
            }
        } while (next_permutation(all(b)));
    } while (next_permutation(all(a)));
    return false;
}

int kek[10][20];

int main() {
//    files1;
    fast_io;

    // cout << brute();
    // return 0;

    solve();
    return 0;


    for (int n = 1; n <= 6; n++) {
        for (int k = 1; k <= 10; k++) {
            {
                ofstream cout("input.txt");
                cout << n << ' ' << k << endl;
            }

            if (brute() != solve()) {
                cout << n << ' ' << k << endl;   
                exit(228);
            }
            if (brute()) {
                kek[n][k] = 1;
            }
        }
    }

    for (int i = 1; i <= 6; i++)
        for (int j = 1; j <= 10; j++) {
            cout << kek[i][j] << (2 * j - 1 <= i) << " \n"[j == 10];
        }
    return 0;
}

Measured memory_bytes: 7396