import java.io.*;
import java.util.*;

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

import java.util.*;

/**
 *
 * @author Izhari Ishak Aksa
 */
public class ProblemC {

    static int ret = 0;
    
    static void check(String a, int A) {
        int x = Integer.parseInt(a);
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 1; i < a.length(); i++) {
            String c = a.substring(i) + a.substring(0, i);
            int y = Integer.parseInt(c);
            if (y >= A && y < x && !map.containsKey(y)) {
                ret++;
                map.put(y, 1);
            }
        }
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = Integer.parseInt(sc.nextLine());
        for (int t = 1; t <= T; t++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            ret = 0;
            for (int i = a + 1; i <= b; i++) {
                check(i + "", a);
            }
            System.out.println("Case #" + t + ": " + ret);
        }
    }
    
}
