#include <bits/stdc++.h>

using namespace std;
using PII = pair<int,int>;
using ll = long long;

constexpr int N = 2e6 + 10;

int w[N];
void solve() {
	int n, m;
	cin >> n >> m;
	int k = 1;
	for(int i = 1; i <= 5; i ++) {
		k = k * 2;
	}
	ll cur = m;
	vector<int> ans;
	ans.push_back(cur);
	cur *= 2;
	for(int i = 2; i <= 6; i ++) {
		while(1) {
			bool ok = 1;
			for(auto v : ans) {
				if((v ^ cur) % m) {
					ok = 0;
				}
			}
			if(ok) {
				ans.push_back(cur);
				cur *= 2;
				break;
			}
			else cur *= 2;
		}
	}
	for(int i = 1; i <= n; i ++) {
		for(auto v : ans) {
			cout << v << " ";
		}
		cout << "\n";
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	t = 1;
	while(t --){
		solve();
	}
}