import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.util.*;
import java.lang.*;
import java.io.*;

class recycle
{
    public static void main(String args[])
    {
	try
	{
	    PrintWriter pw=new PrintWriter("out.txt"); 
	    //creating file reader instance and reading first line
	    BufferedReader br=new BufferedReader(new FileReader(args[0]));
	    String line=br.readLine();
	    int T=Integer.parseInt(line); //number of test cases T
	    //-------------------------
	    //processing each test case
	    for(int i=0;i<T;++i)
	    {
		String[] testcase=br.readLine().split(" ");
		long A = Long.parseLong(testcase[0]);
		long B = Long.parseLong(testcase[1]);
		//System.out.println(A+" "+B); //remove
		int len=1;
		long copyA = A;
		while((copyA=copyA/10) != 0)
		    len++;
		//System.out.println("len is: "+len);
		if(len==1)
		{
		    pw.println("Case #"+(i+1)+": 0");
		    continue;
		}
		long result=0;
		for(long n=A;n<B;++n)
		{
		    int ilen = 1;
		    while(ilen<len)
		    {
			int index = (int)Math.pow(10,ilen);
			int base = (int)Math.pow(10,len-ilen);
			//	System.out.println("index: "+index);
			long last=n % index;
			long m=(last*base)+(n/index);
			//	System.out.println("n="+n+" : m="+m);
			if(m>n && m<=B)
			{
			    result++;
			    //  System.out.println("valid");
			}
			++ilen;
		    }
		}

		//		System.out.println("Case #"+(i+1)+": " + result);

		pw.println("Case #"+(i+1)+": " + result);
		/*------------------------**/
	    }
	    br.close();
	    pw.close();
	}//end of try
	catch(Exception e)
	{
	    System.out.println("Exception caught: "+e);
	}	
   } 
}