
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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;


public class RecycledNumbers {

	static HashSet<String> set = new HashSet<String>();
	public static void main(String[] args) throws IOException{
		
		BufferedReader br = new BufferedReader(new FileReader("small-C.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("small-C.out"));
		
		int n = Integer.parseInt(br.readLine());
		
		for(int i = 1; i <= n; i++){
			set.clear();
			int total = 0;
			String [] temp = br.readLine().split(" ");
			int a = Integer.parseInt(temp[0]);
			int b = Integer.parseInt(temp[1]);
			
			for(int j = a; j < b; j++)
				total += check(j, a, b, temp[0], temp[1]); 
			
			out.write("Case #" + i + ": " + set.size());
			if(i < n)
				out.write("\n");
		}
		System.out.println(set.size());
		br.close();
		out.close();
	}

	private static int check(int n, int a, int b, String astr, String bstr) {
		
		int num = 0;
		String temp = n + "";
		
		for(int len = 1; len < astr.length(); len++){
			String one = temp.substring(0, len);
			String two = temp.substring(len);
			
			int temp2 = Integer.parseInt(two + one);
			if(temp2 > n && temp2 <= b){
				num++;
				if(set.contains(n + " " + temp2))
					System.out.println("Contained *********************************************************\n*****\n***");
				else{
					set.add(n + " " + temp2);
				}
				//System.out.println(one + " " + two + " --> " + two + " " + one + " len = " + len);
			}
		}
		if(num > 0)
			System.out.println();
		return num;
	}

}
