#!/bin/sh
f=/tmp/o$$
cat >$f.cpp <<'EOF'
#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <cmath>
#include <chrono>
using namespace std;
int main(int ac,char**av){int A=atoi(av[1]),B=atoi(av[2]),C=atoi(av[3]);double h=.5;int W=280,H=220,N=W*H,P=667,K=A+B+C;vector<pair<int,int>>p;for(int y=0;y<=110;y+=5)for(int x=0;x<=140;x+=5)p.push_back({x,y});vector<vector<vector<int>>>v(3,vector<vector<int>>(P));for(int t=0;t<3;t++)for(int q=0;q<P;q++){auto[x,y]=p[q];int r=t?5:20;for(int j=max(0,(int)((y-r)/h));j<min(H,(int)((y+r)/h+1));j++)for(int i=max(0,(int)((x-r)/h));i<min(W,(int)((x+r)/h+1));i++){double a=(i+.5)*h,b=(j+.5)*h;bool ok=t<2?(a-x)*(a-x)+(b-y)*(b-y)<=r*r:abs(a-x)<=5&&abs(b-y)<=5;if(ok)v[t][q].push_back(j*W+i);}}vector<int>typ(A,0);typ.insert(typ.end(),B,1);typ.insert(typ.end(),C,2);mt19937 g(12345+A*100+B*10+C);int best=0;vector<int>bs,bt;auto st=chrono::steady_clock::now();for(int rep=0;;rep++){if(chrono::duration<double>(chrono::steady_clock::now()-st).count()>5.2)break;auto tt=typ;shuffle(tt.begin(),tt.end(),g);vector<int>s(K);vector<unsigned char>cnt(N);int cur=0;for(int k=0;k<K;k++){int t=tt[k],bq=0,bg=-1;for(int z=0;z<P;z++){int gg=0;for(int u:v[t][z])gg+=!cnt[u];if(gg>bg||(gg==bg&&g()%20==0))bg=gg,bq=z;}s[k]=bq;for(int u:v[t][bq])if(cnt[u]++==0)cur++;}for(int sw=0;sw<3;sw++){bool imp=0;vector<int>ord(K);iota(ord.begin(),ord.end(),0);shuffle(ord.begin(),ord.end(),g);for(int a:ord){int t=tt[a],o=s[a],base=cur;for(int u:v[t][o])if(--cnt[u]==0)base--;int bv=cur,bq=o;for(int z=0;z<P;z++){int w=base;for(int u:v[t][z])w+=!cnt[u];if(w>bv)bv=w,bq=z;}for(int u:v[t][bq])cnt[u]++;s[a]=bq;if(bv>cur)cur=bv,imp=1;}if(!imp)break;}if(cur>best)best=cur,bs=s,bt=tt;}cout<<A<<","<<B<<","<<C<<" BEST "<<best*.25<<" FRAC "<<best/(double)N<<"\n";for(int i=0;i<K;i++)cout<<bt[i]<<":"<<p[bs[i]].first<<","<<p[bs[i]].second<<" ";}
EOF
clang++ -O3 -std=c++17 $f.cpp -o $f&&$f "$@"