#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100005;
int f[N];
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	srand(time(0));
	int n=2;
	int k=2*n-1,qwq=0;
	for(int i=1;i<=k;++i){
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
		f[++qwq]=i;
	}
//	for(int i=k/2+1;i<=k;++i){
//		f[++qwq]=i;
//		f[++qwq]=i;
//	}
	for(int i=2;i<=qwq;++i)
		swap(f[i],f[rand()%i+1]);
	cout << 1 << '\n' << n << ' ' << qwq << ' ' << k << '\n';
	for(int i=1;i<=qwq;++i)
		cout << f[i] << ' ';
	cout << '\n';
	return 0;
}
