import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.*;
import java.util.*;
class GoogleRecycle
{
	public static void main(String[] args)
	{
		Integer a,b,m,n;
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		Scanner sc=new Scanner(new InputStreamReader(System.in));
		int t=sc.nextInt();
		String ans[]=new String[t];
		for(int i=0;i<t;i++)
		{
			a=sc.nextInt();
			b=sc.nextInt();
			HashMap<Integer, HashMap<Integer,Integer>> h=new HashMap<Integer, HashMap<Integer,Integer>>();
			int temp=b,d=0,req=0;
//			System.out.println(a+" "+b);
//			System.out.println("********");
			while(temp!=0)
			{
				temp/=10;
				d++;
			}
			for(int j=a;j<b;j++)
			{
				temp=1;
				int rem,quo,oth;
				for(int k=1;k<d;k++)
				{
					temp*=10;
					rem=j%temp;
					quo=j/temp;
					oth=(int) (rem*Math.pow(10,(d-k)) + quo);
					if(oth<=b && oth >=a && oth>j)
					{
						if(h.containsKey(j))
						{
							if(h.get(j).containsKey(oth))
								continue;
							h.get(j).put(oth,1);
//							System.out.println(j+" "+oth);
							req++;
						}
						else
						{
							HashMap<Integer,Integer> ht=new HashMap<Integer,Integer>();
							ht.put(oth,0);
							h.put(j,ht);
//							System.out.println(j+" "+oth);
							req++;
						}
					}
					
				}
			}
			ans[i]="Case #"+(i+1)+": "+req;
//			System.out.println("------");
//			System.out.println(req);	
//			System.out.println("**********");
		}
		for(int i=0;i<t;i++)
			System.out.println(ans[i]);
	}

}
