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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.*;

public class Recycle {
	public static void main(String args[]){
				
		Recycle t=new Recycle();
		Scanner sc;
		int T;
		int A, B;
		int temp, len;
		int div, rem, no, goo;
		
		int count = 0;
		try{
			sc = new Scanner(new FileReader("test.txt"));
			T = sc.nextInt();
			//in = new BufferedReader(new FileReader("test.txt"));
			PrintWriter pw = new PrintWriter(new FileWriter("Ans.txt"));

			while(T>0)
			{
				goo=0;
				A = sc.nextInt();
				B = sc.nextInt();
				temp = A;	len=1;
				while(temp>=10)
				{
					temp = temp/10;
					len++;
				}
				System.out.println(A+ " " +B+ " " +len);
				for(int i=A; i<B; i++)
				{
					for(int j=1; j<len; j++){
						rem = i%(int)Math.pow(10,j);
						div = i/(int)Math.pow(10,j);
						no = rem*(int)Math.pow(10, len-j) + div;
						//pw.println(i+ " "+rem+ " " + div+" " +no);
						if(no>A && no<=B && no>i){ 
							//pw.println(i+","+no+","+j);
							goo++;
						}
					}
				}
				
				System.out.println(goo);
				pw.println("Case #"+ ++count +": "+ goo);
				pw.flush();
				
				T--;
			}
			pw.close();
		}catch(Exception e){}

	}
}
