import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map.Entry;
import java.util.Scanner;

public class G_3 {

    static int a, b;
    static HashMap<String, Integer> map;

    static String change(int n) {
        String s = "" + n;
        int len = s.length();
        int min = Integer.MAX_VALUE;
        int value;
        // String best = null;
        for (int i = 0; i < len; i++) {
            s = s.charAt(len - 1) + s.substring(0, len - 1);
            value = Integer.parseInt(s);
            if (min > value) {
                min = value;
                // best = s;
            }
        }
        return "" + min;
    }

    public static void main(String[] args) throws IOException {
        PrintWriter bw = new PrintWriter(new FileWriter("1.txt"));
        Scanner scan = new Scanner(System.in);
        int T = scan.nextInt();
        map = new HashMap<String, Integer>();
        for (int i = 0; i < T; i++) {
            map.clear();
            a = scan.nextInt();
            b = scan.nextInt();
            for (int j = a; j <= b; ++j) {
                String str = change(j);
                // System.out.println(str);

                if (map.containsKey(str)) {
                    map.put(str, map.get(str) + 1);
                } else {
                    map.put(str, 1);
                }
            }
            long sum = 0;
            for (Entry<String, Integer> e : map.entrySet()) {
                int n = e.getValue();
                sum += n * (n - 1) / 2;
            }
            System.out.println(String.format("Case #%d: %d", (i + 1), sum));
            bw.write(String.format("Case #%d: %d\n", (i + 1), sum));
        }
        bw.flush();
        bw.close();
    }
}
