
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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.sql.Types;


public class Recycled {

	/**
	 * @param args
	 * @throws IOException 
	 */
	
	public static  int calc(int a,int b) {
		int result = 0;
		int[] numbers = new int[b-a+1];
		int ncircle = 0;
		int type=1;
		for (int i = a; i <= b; i++) {
			ncircle = 0;
			
			if(numbers[i-a]==0)
			{
				numbers[i-a]=type;
				ncircle = 1;
				int tmp=1;
				int n=0;
				while (i/tmp!=0) {
					tmp*=10;
					++n;
				}
				--n;
				tmp /= 10;
				int cur =i;
				for (int j = n; j >0; --j) {
					int up = cur/10;
					int down = cur%10;
					cur = down * tmp + up;
					if(down!=0)
					{
						int shifted = cur;
						if((shifted>=a) && (shifted <=b))
						{
							if(numbers[shifted-a]==0)
							{
								
								numbers[shifted-a]=type;
								++ncircle;
							}
							
						}
					}
				}
				
				result += (ncircle)*(ncircle-1)/2;
				++type;
			}else {
				
			}
		}
		return result;
	}
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader bReader  = new BufferedReader(new InputStreamReader(System.in));
		String number = bReader.readLine();
		int num = Integer.parseInt(number);
		for (int i = 0; i < num; i++) {			
			String s = bReader.readLine();
			String[] strs = s.split(" ");
			int A = Integer.parseInt(strs[0]);
			int B = Integer.parseInt(strs[1]);
			System.out.println("Case #"+(i+1)+": "+calc(A, B));
		}

	}

}
