/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("C-small-attempt0.in"));
		System.setOut(new PrintStream("C-small-attempt0.out"));

		int t = scan.nextInt();
		for (int c = 0; c < t; c++) {
			int a = scan.nextInt();
			int b = scan.nextInt();
			int ans = 0;
			int[] bDigits = digits(b);

			for (int n = a; n < b; n++) {
				int[] nDigits = digits(n);
				int digitCount = nDigits.length;
				Set<Integer> done = new HashSet<Integer>();
				for (int i = 1; i < digitCount; i++) {
					int[] mDigits = rotate(nDigits, i);
					int m = normal(mDigits);
					if (isLess(nDigits, mDigits) && isLessEq(mDigits, bDigits)
					        && !done.contains(m)) {
						ans++;
						done.add(m);
						/*
						 * if (c == 3) { if (normal(nDigits) != n) throw new
						 * AssertionError(); System.out.println(n + " " + m); if
						 * (n < a || n >= m || m > b) throw new
						 * AssertionError(); }
						 */
					}
				}
			}

			System.out.printf("Case #%d: %d%n", c + 1, ans);
		}
	}

	private static int[] digits(int n) {
		int num = 0;
		int temp = n;
		while (temp > 0) {
			num++;
			temp /= 10;
		}

		int[] dig = new int[num];
		temp = n;
		for (int i = 0; i < num; i++) {
			dig[num - i - 1] = temp % 10;
			temp /= 10;
		}
		return dig;
	}

	private static int[] rotate(int[] num, int r) {
		int n = num.length;
		int[] ans = new int[n];
		for (int i = 0; i < r; i++) {
			ans[i] = num[n - r + i];
		}
		for (int i = 0; i < n - r; i++) {
			ans[r + i] = num[i];
		}
		return ans;
	}

	private static int normal(int[] num) {
		int base = 1;
		int ans = 0;
		for (int i = 0; i < num.length; i++) {
			ans += num[num.length - 1 - i] * base;
			base *= 10;
		}
		return ans;
	}

	private static boolean isLess(int[] a, int[] b) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] < b[i])
				return true;
			if (a[i] > b[i])
				return false;
		}
		return false;
	}

	private static boolean isLessEq(int[] a, int[] b) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] < b[i])
				return true;
			if (a[i] > b[i])
				return false;
		}
		return true;
	}
}