#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long
void solve();
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
solve();
return 0;
}
vector<vector<int>> vec;
void print() {
cout << sz(vec) << endl;
for (auto &a: vec) {
for (auto &u: a) cout << u << ' ';
cout << endl;
}
cout << endl;
}
void add(vector<int> &a) { vec.pb(a); }
int n, m;
vector<int> a;
void solve() {
cin >> n >> m; a.clear(), a.resize(n, -1);
int cnt=0;
for (int i=0; i+1<n; i+=2) {
a[i]=a[i+1]=cnt++;
}
if (n%2) a[n-1]=cnt++;
for (int i=0; i<n-1; i++) {
add(a);
a.insert(a.begin(), cnt++);
a.pop_back();
}
cnt=0;
for (int i=0; i+1<n; i+=2) {
a[i]=a[i+1]=cnt++;
}
if (n%2) a[n-1]=cnt++;
for (int i=0; i<n-1; i++) {
add(a);
int bk=a.back();
a.pop_back();
if (a.back()!=bk) a.insert(a.begin(), bk);
else a.insert(a.begin(), cnt++);
}
print();
}
