#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#define nmax_def 110000
#define Cmax_def 2200
#define mod 1000000007
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

int main() {
	ll N, K;
	cin >> N >> K;
	if (2 * K > 1 + N) {
		cout << "-1" << endl;
	}
	else {
		ll N_2 = N / 2;
		rep(i, N) {
			ll a = K;
			ll b = K + N;
			ll c = K + N * 2;
			if (i < N_2) {
				a += N_2 - 1 - i;
				b += 2 * i + 1;
			}
			else {
				a += N + N_2 - 1 - i;
				b += 2 * (i - N_2);
			}
			c += i;
			cout << a << " " << b << " " << c << endl;
		}
	}

	return 0;
}