import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.File;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;


public class C {
	public static void main(String[] args) throws Exception{
		long tIni=System.currentTimeMillis();
		Scanner s=new Scanner(new File("./data/C.txt"));
		PrintWriter pw=new PrintWriter(new File("./data/C_sol.txt"));
		int ncases=s.nextInt();s.nextLine();
		for(int curr=0;curr<ncases;curr++){
			int ans=0;
			
			int A=s.nextInt(),B=s.nextInt();
			int len=(""+A).length();
			
			for(int j=A;j<B;j++){
					int [] used=new int[len]; int lastUsed=0; Arrays.fill(used, -1);
					int base=10;
					int exp=10;
					for(int i=1;i<len-1;i++)
						exp*=10;
					for(int k=1;k<len;k++){
						
						int r=j%base;
						int div=j/base;
						
						int resp=r*exp+div;
						
						
						if(resp>A && resp<=B && resp>j )
						{
							boolean ok=true;
							for(int i=0;i<len;i++)
								if(resp==used[i])
									ok=false;
							if(ok){
								ans++;
								//System.out.println(j+" "+resp);
								used[lastUsed++]=resp;
							}
						}
						
						base*=10;
						exp/=10;
				}
			}
			
			/**for(int i=A;i<B;i++){
				int [] used=new int[len]; int lastUsed=0; Arrays.fill(used, -1);
				
				String numS=i+"";
				for(int k=1;k<len;k++){
					String o = numS.substring(k)+numS.substring(0,k);
					if(Integer.parseInt(o)>i && Integer.parseInt(o)<=B ){
						boolean ok=true;
						int resp=Integer.parseInt(o);
						for(int j=0;j<len;j++)
							if(resp==used[j])
								ok=false;
						if(ok){
							ans++;
							//System.out.println(j+" "+resp);
							used[lastUsed++]=resp;
						}
					}
				}
			}*/
			
			pw.println("Case #"+(curr+1)+": " +ans);
			System.out.println("+++++++++++++++");
		}
		long tFin=System.currentTimeMillis();
		System.out.println("Time: "+ (tFin-tIni) +" msec");
		pw.close();
		
	}
	
}
