package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;
import java.util.TreeSet;

/**
 *
 * @author violetlily
 */
public class Jam2012Q_C_S {

    private final String ipath = "C-small-attempt0.in";
    private final String opath = "C-small-attempt0.ou";
//    private final String ipath = "C-large.in";
//    private final String opath = "C-large.ou";

    public void Handle() throws FileNotFoundException {

        PrintStream out = new PrintStream(   
                new BufferedOutputStream(   
                        new FileOutputStream(opath)));   
        System.setOut(out);

        Scanner sc = new Scanner(new FileInputStream(new File(ipath)));
        int t = sc.nextInt();
        int ii = 1;
        while (t > 0) {

            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = 0;
    
            for (int i = a; i <= b; i++) {
                TreeSet ts = new TreeSet();
                String ta = Integer.toString(i);
                String tb = ta + ta;
                for (int j = 0; j < ta.length(); j++) {
                    int tc = Integer.valueOf(tb.substring(j, j + ta.length()));
                    if (tc > i && tc <= b) {
                        ts.add(tc);
                    }
                }
                c += ts.size();
            }

            System.out.println("Case #" + ii + ": " + c);
            
            ii++;
            t--;
        }
        out.close();
    }

    public static void main(String args[]) throws Exception {
        Jam2012Q_C_S t = new Jam2012Q_C_S();
        t.Handle();
    }
}
