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.io.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers {
	public static void main(String[] args){
		Scanner in;
		try {
			in = new Scanner(new File("C-small-attempt0.in"));
			solve(in);
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}
	public static void solve(Scanner in){
		int cases =in.nextInt();
		for(int i = 1; i<=cases; i++){
			int min = in.nextInt();
			int max = in.nextInt();
			int ans = 0;
			for(int j =min; j<=max; j++){
				ans+=combos(j, min, max);
			}
			System.out.println("Case #" +i+": "+(ans/2));
			
		}
		
	}
	public static int combos(int num, int min, int max){
		if(num<10){
			return 0;
		}
		HashSet<Integer> diffNums = new HashSet<Integer>();
		diffNums.add(num);
		int ans = 0;
		String numString = num+"";
		for(int i =0; i< numString.length(); i++){
			numString = numString.substring(1)+numString.charAt(0);
			int numTest = Integer.parseInt(numString);
			if(numTest<=max&&numTest>=min&&diffNums.add(numTest)){
				ans++;
			}
		}
		return ans;
		
		
	}
	
}
