/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

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

public class PracticeC
{
	/* ±±©çÒW */
	private static final String fname = "C-small-attempt3.in"; // üÍpÌt@C¼
//	private static final int N = 10000;

	// private static void search(int v)
	// {
	// if (v < 21)
	// return;
	// String in = Integer.toString(v);
	// for (int i = 0; i < in.length(); i++)
	// {
	// String vs = "";
	// for (int j = 0; j < in.length(); j++)
	// {
	// char n = in.charAt((i + j + 1) % in.length());
	// if (vs.equals("") && n == '0')
	// break;
	// vs += n;
	// }
	// // System.out.println(v2);
	// if (vs.equals(""))
	// continue;
	// int v2 = Integer.valueOf(vs);
	// if (v > v2) val[v]++;
	// }
	// }

	private static void search(int v, int A, int B)
	{
		use = new boolean[B+1];
		String in = Integer.toString(v);
		for (int i = 0; i < in.length(); i++)
		{
			String vs = "";
			for (int j = 0; j < in.length(); j++)
			{
				char n = in.charAt((i + j + 1) % in.length());
				if (vs.equals("") && n == '0')
					break;
				vs += n;
			}
			// System.out.println(v2);
			if (vs.equals(""))
				continue;
			int v2 = Integer.valueOf(vs);
			if (v2 >= A && v > v2 && !use[v2])
			{
				use[v2] = true;
				val[v]++;
			}
		}
	}
	public static int val[];
	public static boolean use[];

	public static void solve()
	{
		int T = sc.nextInt();
		// for (int i = 21; i < val.length; i++) search(i);
		// for (int i = 0; i < 100; i++) if(val[i] != 0)
		// System.out.println(i+":"+val[i]);
		for (int i = 1; i <= T; i++)
		{
			int A = sc.nextInt();
			int B = sc.nextInt();
			val = new int[B+1];
			for (int j = A; j <= B; j++)
				search(j, A, B);
			int cnt = 0;
			for (int j = A; j <= B; j++)
			{
//				if(val[j] != 0) System.out.println(j+":"+val[j]);
				cnt += val[j];
			}
//			System.
			out.println("Case #" + i + ": " + (cnt));
		}
	}
	/* ±±ÜÅ */
	private static Scanner sc;
	private static PrintWriter out;
	public static void main(String args[])
	{
		try
		{
			sc = new Scanner(new File(fname));
//			sc = new Scanner(System.in);
			out = new PrintWriter(new BufferedWriter(new FileWriter(new File(fname + "_out.dat"))));
		} catch (Exception e)
		{
			e.printStackTrace();
		}
		solve();
		out.close();
	}

}
