
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.FileReader;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class RecycledNumbers {
//	private static String INPUT_FILE = "input.txt";
	private static String INPUT_FILE = "C-small-attempt0.in";
	
	
	private static final String DELIM = " ";
	
	public void solve() {
		try {
			BufferedReader in = new BufferedReader(new FileReader(INPUT_FILE));
			
			int T = Integer.valueOf(in.readLine());
			
			String line;
			for(int i = 0; i < T; i++) {
				line = in.readLine();
				
				StringTokenizer st = new StringTokenizer(line, DELIM);
				
				int A = Integer.valueOf(st.nextToken());
				int B = Integer.valueOf(st.nextToken());
				
				process(i + 1, A, B);
			}
		}
		catch(Exception e) {}
	}
	
	protected void process(int idx, int A, int B) {
		int cnt = 0;
		
		String digit;
		int len;
		StringBuffer sb;
		String r;
		int d;
		LinkedList<String> list = new LinkedList<String>();
		String pair;
		
		for(int i = A; i <= B; i++) {
			digit = Integer.toString(i);
			len = digit.length();
			
			if(len > 1 && !digit.endsWith("0")) {
				for(int j = 1; j <= len - 1; j++) {
					sb = new StringBuffer();
					sb.append(digit.substring(len - j, len));
					sb.append(digit.substring(0, len - j));
					
					r = sb.toString();
					
					if(r.charAt(0) != '0' && !r.equals(digit)) {
						d = Integer.valueOf(r);
						
						if(d >= A && d <= B) {
							if(i < d)
								pair = i + "|" + d;
							else
								pair = d + "|" + i;
							
							if(!list.contains(pair)) {
								list.add(pair);
								cnt++;
							}
						}
					}
				}
			}
		}
		
		System.out.println("Case #" + idx + ": " + cnt);
	}
	
	public static void main(String[] args) {
		RecycledNumbers r = new RecycledNumbers();
		r.solve();
	}

}
