//I wrote this code 4 u today
#include <bits/stdc++.h>

template<class t> using vc = std::vector<t>;

#define nd node*
#define pnd pair<nd, nd>

using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vc<pll> vpll;
typedef vc<vll> vvll;
typedef vc<vpll> vvpll;

template<const ll MOD>
struct mod_mul : std::multiplies<const ll> {
    ll operator()(const ll a, const ll b) {
        return (a * b) % MOD;
    }
};


template<typename T>
inline void sort(T &a) {
    sort(a.begin(), a.end());
}

template<typename T>
inline void unique(T &a) {
    a.resize(unique(a.begin(), a.end()) - a.begin());
}

template<typename T>
inline void reverse(T &a) {
    reverse(a.begin(), a.end());
}

const ll INF = 9023372036854775808ll;
const ll MOD = 1000000007ll;

vc<int> a;
int n, d;

bool check() {
    for (int i = 0; i < 1 << a.size(); ++i) {
        int xr = 0;
        for (int j = 0; j < 6; ++j) {
            if (i >> j & 1) xr ^= a[j];
        }
        if (xr % d != 0) return false;
    }
    return true;
}

bool gen() {
    if (a.size() == 6) {
        if (check()) {
            for (int z = 0; z < n; ++z) {
                for (auto &i: a) cout << i << ' ';
                cout << '\n';
            }
            exit(0);
            return true;
        }
        return false;
    }
    for (int x = a.back() + 1; x < 1000000; ++x) {
        a.push_back(x);
        if (check() && gen()) return true;
        a.pop_back();
    }
    return false;
}

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    cin >> n >> d;
    a = {0};
    gen();
}