#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <ctime>
#include <unordered_map>
#include <map>
#include <set>

using namespace std;
typedef long long ll;

const int inf = 20000 * 10000 + 10;
int a[5001];
set<int> sset;


int main() {
	int n = 5000;
	int k = 20;
	cout << n << ' ' << k << endl;
	cout << 1;
	for (int i = 2; i <= n; ++i)
		cout << ' ' << i;
	cout << endl;
	cout << k << endl;
	for (int i = 0; i < k; ++i)
		cout << 20000 * 10000 << endl;
	return 0;
}