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.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;
    }

}