#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

bool isprime(int K){
	rep(i,2,K){
		if(K%i==0) return false;
	}
	return true;
}

void mainmain(){
	int K = 4;
	while(K*(K-1)+1<1000 || !isprime(K-1)) K++;
	int n = K*(K-1)+1;
	// assert(1000<=n && n<=2000);
	cout<<n<<" "<<K<<endl;
	vvint vv(n);
	vv[0].PB(0);
	rep(i,1,n){
		vv[i].PB((i-1)/(K-1));
	}
	// rep(i,n){
	// 	for(int x: vv[i]){
	// 		cout<<x+1<<" ";
	// 	}
	// 	cout<<endl;
	// }
	// cout<<endl;
	rep(i,1,n){
		vv[(i-1)/(K-1)].PB(i);
		if(i+1>K){
			int p = (i-1)/(K-1)-1;
			int off = (i-K)%(K-1);
			int pp = off;
			for(int j=K; j<n; j+=K-1){
				vv[j+pp].PB(i);
				(pp+=p)%=(K-1);
			}
		}
	}
	rep(i,n){
		rep(j,vv[i].size()){
			if(j) cout<<" ";
			cout<<vv[i][j]+1;
		}
		cout<<endl;
	}
	// rep(i,n){
	// 	rep(j,i){
	// 		set<int> se;
	// 		rep(k,vv[i].size()) se.insert(vv[i][k]);
	// 		rep(k,vv[j].size()) se.insert(vv[j][k]);
	// 		if(se.size()!=2*K-1){
	// 			cout<<"error"<<" "<<i<<" "<<j<<endl;
	// 			rep(k,vv[i].size()) cout<<vv[i][k]+1<<" ";
	// 			cout<<endl;
	// 			rep(k,vv[j].size()) cout<<vv[j][k]+1<<" ";
	// 			cout<<endl;
	// 			assert(0);
	// 		}
	// 	}
	// }
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 896