import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.*;
import java.util.*;
class Replace
{
	public static void main(String args[])throws Exception
	{
		//Scanner sc = new Scanner(System.in);
		// PrintWriter pw = new PrintWriter(System.out);
		Scanner sc = new Scanner(new FileReader("C-small-attempt1.in"));
		//Console console=System.console(new FileReader("B-small-practice-1.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C-small-attempt1.out"));
		int ntest = sc.nextInt();
		//int a=100;
		//int b=500;
		
		for(int k=1;k<=ntest;k++)
		{
		int sum=0;
		int count=0;
		//int a=Integer.parseInt(sc.next());
		//int b=Integer.parseInt(sc.next());
		int a=sc.nextInt();
		int b=sc.nextInt();
		
		for(int i=a;i<=b;i++)
		{
				if(i>0 && i<100)
				{
					int rem=i%10;
					sum=rem*10+i/10;
					if(sum==i)
					{
					}
					else if(sum>=a && sum<=b)
					{
						count++;
						System.out.println(i);
						//System.out.println("garg");
					}
				}
				if(i>=100 && i<1000)
				{
					int rem=i%100;
					sum=rem*10+i/100;
					//System.out.println(i);
					
					if(sum==i)
					{
					}
					else if (sum>=a && sum<=b)
					{
						count++;
						//System.out.println(i);
					}
					//System.out.println("lucky");
					rem=i%10;
					sum=rem*100+i/10;
					if(sum==i)
					{
					}
					else if(sum>=a && sum<=b)
					{
						count++;
						//System.out.println(i);
						//System.out.println("garg");
					}
				}
					
					
				
		}
		pw.print("Case #" + k + ": ");
		pw.print(count/2);
		pw.println();
		}
		pw.close();
		sc.close();
	}
}