#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 5;
int n, d, dice[6], r[25], tot, c[maxn], pc[maxn], pr[3];
int main() {
	pc[0] = 0;
	for(int i = 1; i < maxn; ++ i)
		pc[i] = pc[i >> 1] + (i & 1);
	scanf("%d%d", &n, &d);
	int bit = 0, tmp = d;
	while(tmp % 2 == 0)
		tmp /= 2, ++ bit;
	int now = 0;
	for(int j = bit; j < 20; ++ j) {
		int x = 1 << j;
		r[j] = x % d;
		now |= x;
	}
	for(int j = 1; j < 1 << 20; ++ j) {
		if((now & j) != j)
			continue;
		int all = 0;
		for(int k = 0; k < 20; ++ k) {
			if(j >> k & 1) {
				all += r[k];
			}
		}
		if(all % d == 0) {
			c[tot ++] = j;
		}
	}
	for(int s = 0; s < 3; ++ s) {
		int cho = -1;
		for(int j = 0; j < tot; ++ j) {
			if((now & c[j]) != c[j]) {
				continue;
			}
// cerr << now << " " << c[j] << " " << cho << endl;
			if(cho == -1 || pc[cho] > pc[c[j]])
				cho = c[j];
		}
		assert(cho != -1);
		pr[s] = cho;
		now ^= cho;
	}
	for(int s = 0; s < 6; ++ s) {
		int x = 0;
		for(int j = 0; j < 3; ++ j) {
			if(s >> j & 1) {
				for(int w = 0; w < 20; ++ w) {
					if(pr[j] >> w & 1)
						x |= 1 << w;
				}
			}
		}
		dice[s] = x;
	}
	for(int i = 0; i < n; ++ i) {
		for(int j = 0; j < 6; ++ j)
			printf("%d ", dice[j]);
		puts("");
	}
	for(int j = 0; j < 6; ++ j)
		for(int k = 0; k < 6; ++ k)
			assert((dice[j] ^ dice[k]) % d == 0);
	for(int j = 0; j < 6; ++ j)
		for(int k = 0; k < 6; ++ k)
			for(int l = 0; l < 6; ++ l)
				assert((dice[j] ^ dice[k] ^ dice[l]) % d == 0);
	return 0;
}