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.*;
import java.util.ArrayList;
import java.util.StringTokenizer;

/*
 * To change this template, choose Tools | Templates and open the template in the editor.
 */
/**
 *
 * @author doda
 */
public class RecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        // TODO code application logic here
        BufferedReader R = new BufferedReader(new FileReader("C:\\Users\\doda\\Desktop\\C-large.in"));
        PrintWriter P = new PrintWriter(new FileWriter("C:\\Users\\doda\\Desktop\\large.txt"));
        
        while (R.ready()) {
            int t = Integer.parseInt(R.readLine());
            for (int i = 0; i < t; ++i) {
                StringTokenizer s = new StringTokenizer(R.readLine());
                int out = 0;
                String O = "Case #" + (i + 1) + ":";
                int n = Integer.parseInt(s.nextToken());
                int m = Integer.parseInt(s.nextToken());
                for (int j = n; j <= m; ++j) {
                    int l[] = diffOrder(j);
                    for (int k = 0; k < l.length; ++k) {
                        if (l[k] > j && l[k] <= m) {
                            ++out;
                        }
                    }
                }
                O += " " + out;
                P.println(O);
            }
        }
        P.close();
    }

    public static int[] diffOrder(int num) {
        String s = "" + num;
        ArrayList<Integer> in = new ArrayList<Integer>();
        int re[];
        for (int i = 0; i < s.length() - 1; ++i) {
            s = s.charAt(s.length() - 1) + "" + s.substring(0, s.length() - 1);
            int y = Integer.parseInt(s);
            String h = "" + y;
            if (h.length() < s.length()) {
                y = 0;
            }
            if (!in.contains(y) && y != 0) {
                in.add(y);
            }
        }
        re = new int[in.size()];
        for (int i = 0; i < in.size(); ++i) {
            re[i] = in.get(i);
        }
        return re;
    }

}