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

public class ProblemC {

	
	public static void main(String[] args) throws Exception  {

		Scanner sc = new Scanner(new File("C:\\C-small-attempt0.in"));
		//Scanner sc = new Scanner(System.in);
		int cases = Integer.parseInt(sc.nextLine().trim());
		for(int i = 0; i < cases; i++){
			int a = sc.nextInt();
			int b = sc.nextInt();
			System.out.println("Case #" + (i + 1) + ": " + solve(a,b));
		}
	}

	
	private static int solve(int a, int b) {
		int [][]vis = new int[b + 1][b + 1];
		int count = 0;
		
		for(int i = a; i <= b; i++){
			int []arr = getPair(i);
			
			for(int j : arr){
				if((j >= a) && (j <= b) && (i != j) && vis[i][j] != 1){
					vis[i][j] = 1;
					vis[j][i] = 1;
					//System.out.println(i + " " + j);
					count++;
				}
			}
		}
		return count;
	}


	private static int[] getPair(int i) {
		int []ret = new int[]{};
		
		String str = String.valueOf(i);
		if(str.endsWith("0")){
		}
		else if(i < 10){
		} else if (i < 100){
			int a1 = i %10;
			int a2 = i/10;
			int a3 = a1*10 + a2;
			ret = new int[]{a3};
		} else if (i <= 1000){
			int a1 = i % 10;
			int a2 = ((i - a1)/10) % 10;
			int a3 = i/100;
			
			int a4 = a1*100 + a3*10 + a2;
			int a5 = a2*100 + a1*10 + a3;
			
			ret = new int[]{a4,a5};
		}
		return ret;
	}
}
