#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include <algorithm>#include <vector>#include <queue>#include <map>#define inf 0x3f3f3f3fusing namespace std;int match[130],play[130],t,n,r,tmp,i,j,cnt,m,x,rou,p1,p2,ans;int main(){ match[0]=1; tmp=64; r=2; for(i=1;i<=7;i++) { for(j=0;j<128;j+= 2*tmp) { match[j+tmp]=r+1-match[j]; } r*=2; tmp/=2; } for(i=0;i<128;i++) play[match[i]]=i; scanf("%d",&t); while(t--) { cnt=0; while(scanf("%d%d",&n,&m)&&(n||m)) { cnt++; tmp=n-1;r=0; while(tmp>0) { tmp/=2; r++; } x=1<<(7-r); ans=inf; for(i=1;i<=(m-1)/2;i++) { if(i<=n&&(m-i)<=n) { rou=0; tmp=x*2; p1=play[i]; p2=play[m-i]; while(p1!=p2) { rou++; p1=p1-(p1%tmp); p2=p2-(p2%tmp); tmp*=2; } if(ans>rou) ans=rou; } } printf("Case %d: Round %dn",cnt,ans); } if(t) putchar('n'); } return 0;}
