import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;


public class CodeJam
{
	public static void main(String[] args) throws Exception
	{
		File input=new File("input.txt");
		BufferedReader bufferedReader=new BufferedReader(new FileReader(input));
		String output="";
		String line=null;
		int lineCount=0;
		
		int caseNumbers=0;
		String solutionString="";
		while((line=bufferedReader.readLine())!=null)
		{
			if(lineCount==0)
			{
				caseNumbers=Integer.parseInt(line);
			}
			else
			{
				int solution=0;
				String[] split=line.split(" ");
				int a=Integer.parseInt(split[0]);
				int b=Integer.parseInt(split[1]);
				int n=a;
				int m=b;
				while(n<m)
				{
					while(n<m)
					{
						if(workout(n, m))
						{
							solution++;
						}
						n++;
					}
					n=a;
					m--;
				}
				solutionString=solutionString+"Case #"+Integer.toString(lineCount)+": "+Integer.toString(solution)+"\n";
			}
			lineCount++;
		}
		System.out.print(solutionString);
	}
	
	public static boolean workout(int n,int m)
	{
		boolean solution=false;
		String t=Integer.toString(n);
		char[] test=t.toCharArray();
		int count=1;
		while(count<=test.length)
		{
			String testString=new String(test);
			
			if(testString.equals(Integer.toString(m)))
			{
				solution=true;
			}
			char x=test[test.length-1];
			int count2=test.length-2;
			while(count2>=0)
			{
				test[count2+1]=test[count2];
				count2--;
			}
			test[0]=x;
			count++;
		}
		return solution;
	}

}
