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.util.*;
import java.io.*;

public class Q3 {

	static int m1(String s) {
		int count=0;
		Scanner sc=new Scanner(s);
		int a=sc.nextInt(), b=sc.nextInt();
		String s1=null, s2=null;
		for (int n=a; n<b; n++)
		{
			for (int m=n+1; m<=b; m++)
			{
				s1=String.valueOf(n); s2=String.valueOf(m);
				if (s1.length()==s2.length())
				{
					List<String> iso=new ArrayList<String>();
					for (int i=0; i<s1.length()-1; i++)
						iso.add(s1.substring(s1.length()-i-1)+s1.substring(0, s1.length()-i-1));
					for (String ss:iso)
						if (ss.equals(s2))
							count++;
				}
			}
		}
		return count;
	}
	public static void main(String[] args) throws IOException {
		File inFile=new File("C-small-attempt0.in");
		File outFile=new File("C-small-attempt0.out");
		BufferedReader br=new BufferedReader(new FileReader(inFile));
		PrintWriter out=new PrintWriter(new FileWriter(outFile));
		StringBuilder sb=new StringBuilder();
		int ntc=Integer.parseInt(br.readLine());
		for (int tc=1; tc<=ntc; tc++)
		{
			String s=br.readLine();
			sb.append("Case #"+tc+": "+m1(s)+"\n");
		}
		out.write(sb.toString());
		br.close();
		out.close();
	}
}
