import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Vector;


public class Main {
	public static int recycled (int A,int B)
	{
		
		if(B<10)return 0;
		String N,M;
		int taille=1,Nbr=0;
		for(int i=10;i<=B;i*=10)taille++;
		for(int i=A;i<=B;i++)
		{
			Vector<Integer> list = new Vector<Integer>();
			N=Integer.toString(i);
			//M=N.substring(1)+N.charAt(0);
			for(int k=0;k<N.length()-1;k++)
			{
				N=N.substring(1)+N.charAt(0);
				if(A<=Integer.parseInt(N)&&Integer.parseInt(N)<=B&&i<Integer.parseInt(N))
					{
					if(!list.contains(Integer.parseInt(N)))
						{
							list.add(Integer.parseInt(N));
							//System.out.println(N  +"       "+i);
							Nbr++;
						}
					}
			}
		}
		return Nbr;
	}
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in =new Scanner(new File("C-small.in"));
		PrintWriter out=new PrintWriter("C-small.out");
		int T,A,B;
		T=in.nextInt();
		for(int i=0;i<T;i++)
		{
			A=in.nextInt();
			B=in.nextInt();
			out.print("Case #"+(i+1)+": ");
			out.print(recycled(A, B));
			if(i+1!=T) out.println("");
		}
		out.close();
		in.close();
	}
}
