/* Pähkinänurkka: Neliöjuuritehtävän jälkipyykki - Skrolli 2018.1 */

#include <iostream>
#include <cmath>
#include <algorithm>
#include <random>
#include <cassert>
#include <vector>
using namespace std;
const int N = 100;
const int K = 25;
typedef long double ld;
typedef pair<ld,int> P;
ld sqrs[N+1];

mt19937 rng(random_device{}());

P* res;
P* res2;

ld target;
ld best=1e100;

void addRes(const vector<int>& A, ld score, int mask, int mask2=0) {
	if (score >= best) return;
	assert(!isnan(score));
	cout<<"new best "<<score<<'\n';
	best = score;
	cout<<"[";
	for(int i=0; i<K; ++i) if (1 & mask>>i) cout<<1+i<<", ";
	for(int i=0; i<K; ++i) if (1 & mask2>>i) cout<<1+K+i<<", ";
	for(int i: A) cout<<1+i<<", ";
	cout<<"]\n";
}

void solveFor(const vector<int>& A, ld sum) {
	ld need = fabsl(target - sum);
	int negate = sum > target ? ~0 : 0;
	constexpr int M = 1<<K;
	for(int i=0,j=0; i<M && res[i].first<=need; ++i) {
		ld z = need-res[i].first;
		while(j+1<M && res2[j+1].first >= z) ++j;
		addRes(A, fabsl(z-res2[j].first), negate ^ res[i].second, negate ^ res2[j].second);
		if (j+1<M) {
			addRes(A, fabsl(z-res2[j+1].first), negate ^ res[i].second, negate ^ res2[j+1].second);
		}
	}
}

bool cmpFirst(P a, P b) { return a.first < b.first; }

int main() {
	res = new P[1<<K];
	res2 = new P[1<<K];

	for(int i=0; i<N; ++i) sqrs[i] = sqrtl(1+i);
	ld sum = 0;
	for(int i=0; i<N; ++i) sum+=sqrs[i];
	target = 0.5*sum;
	cout<<target<<'\n';
	for(int i=0; i<1<<K; ++i) {
		ld x = 0, y=0;
		for(int j=0; j<K; ++j) if (1 & i>>j) {
			x += sqrs[j];
			y += sqrs[j+K];
		}
		assert(isfinite(x));
		res[i] = P(x,i);
		res2[i] = P(y,i);
	}
	cout<<"start\n";
	sort(res,res+(1<<K));
	sort(res2,res2+(1<<K));
	cout<<"sorts done\n";
	reverse(res2,res2+(1<<K));
	uniform_int_distribution<int> distr(0,1);
	vector<int> A;
	A.reserve(N);
	while(1) {
		A.clear();
		ld x = 0;
		for(int i=2*K; i<N; ++i) {
			if (distr(rng)) {
				x += sqrs[i];
				A.push_back(i);
			}
		}
		solveFor(A, x);
	}
}