package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Pairs {

	/**
	 * @param args
	 */
	
	public static int counter=0;
	
	public static void checkhelper(String a,String b)
	{
		if(a.length()!=b.length())
			return;
		if(a.concat(a).contains(b))
			counter++;	
	}
	
	
	public static void check(int a,int b)
	{
		for(int i=a;i<=b;i++)
		{
			for(int j=i+1;j<=b;j++)
			checkhelper(""+i, ""+j);
			
		}
		
		
	}
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub

		
		BufferedWriter bw=new BufferedWriter(new FileWriter("out2.out"));
		BufferedReader bf=new BufferedReader(new FileReader("input.txt"));
		int count=Integer.parseInt(bf.readLine());
		for(int i=0;i<count-1;i++)
		{
			
			String line=bf.readLine();
		String []a=line.split(" ");
		
		check(Integer.parseInt(a[0]),Integer.parseInt(a[1]));
	
	bw.write("Case #"+(i+1)+": "+counter);
	bw.newLine();
	counter=0;
	}
		
		String line=bf.readLine();
		String []a=line.split(" ");
		
		check(Integer.parseInt(a[0]),Integer.parseInt(a[1]));
	
	
	bw.write("Case #"+(count)+": "+counter);
	bw.close();
	}

}
