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

public class ProblemC {
	
	public static void main(String[] args) {
		try {
			new ProblemC().solve();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	public void solve() throws Exception {
		System.setIn(new FileInputStream("D:\\input.in"));
    	Scanner scan = new Scanner(System.in);
    	PrintWriter out = new PrintWriter(System.out);

    	int T = scan.nextInt();
    	for (int i=0;i<T;i++) {
    		int A = scan.nextInt();
    		int B = scan.nextInt();
  
    		long f = find(A, B);
    		System.out.println("Case #" + (i+1) + ": " + f);
    	}

		out.flush();
		out.close();
		scan.close();
	}
	
	private long find(int A, int B) {
		long resx = 0;
		
		for (int i=A;i<B;i++) {
			resx += howmany(i, B);
		}
		
		return resx;
	}
	
	private long howmany(int n, int B) {
		long t = 0;
		String s = String.valueOf(n);
		Set<String> st = new HashSet<String>();
		
		for (int i=1;i<s.length();i++) {
			if (s.charAt(0) > s.charAt(i)) continue;
			String ssub = s.substring(i) + s.substring(0, i);
			int pn = Integer.parseInt(ssub);
			
			
			if (pn > n && pn <= B) {
				t++;
				if (!st.add(s+ssub)) {
					t--;
				}
				//System.out.println(n + ", " + ssub + " ++");
			} else {
				//System.out.println(n + ", " + ssub);
			}
		}
		
		return t;
	}
	
}
