#!/bin/sh
f=/tmp/g$$
cat >$f.cpp <<'EOF'
#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <cmath>
#include <chrono>
#include <numeric>
using namespace std;
int main(int ac,char**av){
int nc2=atoi(av[1]),nc1=atoi(av[2]),nr=atoi(av[3]),S=ac>4?atoi(av[4]):1;double secs=ac>5?atof(av[5]):4.8;
int W=140*S,H=110*S,N=W*H,P=29*23;vector<pair<int,int>>pos;for(int y=0;y<=110;y+=5)for(int x=0;x<=140;x+=5)pos.push_back({x,y});
vector<vector<vector<int>>> pix(3,vector<vector<int>>(P));for(int t=0;t<3;t++)for(int q=0;q<P;q++){double x=pos[q].first,y=pos[q].second;for(int j=0;j<H;j++)for(int i=0;i<W;i++){double a=(i+.5)/S,b=(j+.5)/S;bool ok=t==0?(a-x)*(a-x)+(b-y)*(b-y)<=400:t==1?(a-x)*(a-x)+(b-y)*(b-y)<=25:abs(a-x)<=5&&abs(b-y)<=5;if(ok)pix[t][q].push_back(j*W+i);}}
vector<int>types(nc2,0);types.insert(types.end(),nc1,1);types.insert(types.end(),nr,2);int K=types.size();mt19937 g(1234567+nc2*10000+nc1*100+nr);vector<int>bestS,bestT;int best=0;auto st=chrono::steady_clock::now();
for(int rep=0;;rep++){if(chrono::duration<double>(chrono::steady_clock::now()-st).count()>secs)break;vector<int>tt=types;if(rep>0)shuffle(tt.begin(),tt.end(),g);vector<int>s;vector<short>cnt(N,0);int val=0;
for(int k=0;k<K;k++){int t=tt[k];vector<pair<int,int>>c;for(int q=0;q<P;q++){int gain=0;for(int z:pix[t][q])gain+=cnt[z]==0;c.push_back({gain,q});}sort(c.begin(),c.end());int pool=rep==0?1:min(50,P);uniform_int_distribution<int>d(0,pool-1);int q=c[P-1-d(g)].second;s.push_back(q);for(int z:pix[t][q])if(cnt[z]++==0)val++;}
uniform_real_distribution<double>U(0,1);uniform_int_distribution<int>SI(0,K-1),QI(0,P-1);int iters=max(5000,60000/max(1,K));for(int it=0;it<iters;it++){int a=SI(g),old=s[a],q=QI(g),t=tt[a];if(q==old)continue;int nv=val;for(int z:pix[t][old])if(--cnt[z]==0)nv--;for(int z:pix[t][q])if(cnt[z]++==0)nv++;double T=S*S*(120.0*(1.0-it/(double)iters)+.2);if(nv>=val||U(g)<exp((nv-val)/T))s[a]=q,val=nv;else{for(int z:pix[t][q])cnt[z]--;for(int z:pix[t][old])cnt[z]++;}if(val>best)best=val,bestS=s,bestT=tt;}
for(int sweep=0;sweep<2;sweep++)for(int a=0;a<K;a++){int t=tt[a],old=s[a],base=val;for(int z:pix[t][old])if(--cnt[z]==0)base--;int bq=old,bv=val;for(int q=0;q<P;q++){int v=base;for(int z:pix[t][q])v+=cnt[z]==0;if(v>bv)bv=v,bq=q;}for(int z:pix[t][bq])cnt[z]++;s[a]=bq;val=bv;if(val>best)best=val,bestS=s,bestT=tt;}}
cerr<<"reps done\n";cout<<"BEST "<<best<<" area "<<best/(double)(S*S)<<" frac "<<best/(double)(N)<<" cost "<<nc2*20000+nc1*1600+nr*2000<<"\n";for(int a=0;a<K;a++)cout<<bestT[a]<<":"<<pos[bestS[a]].first<<","<<pos[bestS[a]].second<<" ";cout<<"\n";}
EOF
clang++ -std=c++17 -O3 $f.cpp -o $f && $f "$@"
rm -f $f $f.cpp