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

public class RecycledNumbers {
    public static BufferedReader BR;

    public static String readLine() {
        try {
            return BR.readLine();
        } catch(Exception E) {
            System.err.println(E.toString());
            return null;
        }
    }


    // ****** MAIN ******

    public static void main(String [] args) throws Exception {
        BR = new BufferedReader(new InputStreamReader(System.in));

        int testcases = Integer.parseInt(readLine());
        for (int t = 1; t <= testcases; t++) {
            RecycledNumbers instance = new RecycledNumbers();
            instance.solve(t);
        }

    }

    // ****** GLOBAL VARIABLES ******



    public RecycledNumbers() {
    }

    public boolean solve(int caseNumber) {
    	StringTokenizer st = new StringTokenizer(readLine());
    	int a = Integer.parseInt(st.nextToken());
    	int b = Integer.parseInt(st.nextToken());
    	int n = Integer.toString(a).length();
    	long result = 0;
    	for (int i = a; i <= b; ++i) {
    		String s = Integer.toString(i);
    		Set<Integer> seen = new HashSet<Integer>();
    		for (int j = 1; j < n; ++j) {
    			int rotated = Integer.parseInt(s.substring(j) + s.substring(0,j));
    			if (i < rotated && rotated <= b && !seen.contains(rotated)) {
    				seen.add(rotated);
    				++result;
    			}
    		}
    	}
      System.out.println("Case #" + caseNumber + ": " + result);
			return false;
    }


}
