
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
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]);
	}

}
