import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package google.code.jam.recycled.numbers;

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

/**
 *
 * @author Lucas
 */
public class Utils {
    
    public ArrayList<Integer[]> parse(String file) {

        BufferedReader in = null;
        ArrayList<Integer[]> list = new ArrayList<Integer[]>();
        int size;

        try {

            in = new BufferedReader(new InputStreamReader(new DataInputStream(new FileInputStream(file))));
            size = Integer.parseInt(in.readLine());

            for (int n = 0; n < size; n++) {

                String[] stringCases = in.readLine().split("\\s+");

                Integer[] cases = new Integer[2];
                cases[0] = Integer.parseInt(stringCases[0]);
                cases[1] = Integer.parseInt(stringCases[1]);
                
                list.add(cases);
            }

        } catch (IOException e) {
            e.printStackTrace();
        } finally {
            try {
                if (in != null) {
                    in.close();
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return list;
    }

    public void write(ArrayList<Integer> output, String file) {

        BufferedWriter out = null;

        try {

            out = new BufferedWriter(new FileWriter(file));

            for (int n = 0; n < output.size() - 1; n++) {
                out.write("Case #" + (n + 1) + ": " + output.get(n));
                out.newLine();
            }
            out.write("Case #" + output.size() + ": " + output.get(output.size() - 1));

        } catch (IOException e) {
            e.printStackTrace();
        } finally {
            try {
                if (out != null) {
                    out.flush();
                    out.close();
                }
            } catch (IOException ex) {
                ex.printStackTrace();
            }
        }
    }
    
}
