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.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.TreeSet;


public class C {
	
	public ArrayList<Integer> hash = new ArrayList<Integer>();
	
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int t = scanner.nextInt();
		for (int i = 0; i < t; i++) {
			C c = new C();
			int y = 0;
			int A = scanner.nextInt();
			int B = scanner.nextInt();
			for (int j = A; j <= B; j++) {
//				if(!c.hash.contains(j)) {
//					System.out.println("j="+j);
					y += c.permut(j, A, B);
//				}
			}
			System.out.println("Case #"+(i+1)+": "+y);
		}
	}
	
	public int permut(int j, int A, int B) {
		int y = 0;
		String sj = ""+j;
		int newJ = 0;
		while(newJ != j) {
			char lastDigit = sj.charAt(sj.length()-1);
			String frontNumber = sj.substring(0, sj.length()-1);
			sj = lastDigit + frontNumber;
			newJ = Integer.parseInt(sj);
//			System.out.print(newJ);
			if(newJ >= A && newJ <= B  && newJ > j) {
				y++;
//				if(!hash.contains(newJ)) {
//					hash.add(newJ);
//					System.out.print(" p");
//				}
			}			
//			System.out.println();
		}
//		System.out.println();
		return y;
	}

}
