import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}


import java.io.*;
import java.util.*;
public class trie
{
    public static void main(String[] args)throws IOException
    {
     int i,j,a,b,n,ans;
        String s1="",p1="";
        solver h1=new solver();
        Scanner fin=new Scanner(new File("A.txt"));
        s1=fin.nextLine();
        n=Integer.parseInt(s1);
        FileWriter fstream=new FileWriter("out.txt");
        BufferedWriter out=new BufferedWriter(fstream);
        for(i=0;i<n;i++)
        {
            s1="";
            j=0;
            s1=fin.nextLine();
            out.write("Case #");
            out.write(Integer.toString(i+1));
            out.write(": ");
            while(s1.charAt(j)!=' ')
            {
                p1=p1+s1.charAt(j);
                j++;
            }
            a=Integer.parseInt(p1);
            p1="";
            j++;
            while(j<s1.length())
            {
                p1=p1+s1.charAt(j);
                j++;
            }
            b=Integer.parseInt(p1);
            p1="";
            ans=h1.solve(a,b);
            out.write(Integer.toString(ans));
            out.write("\n");
        }
        out.close();
        
    }
    
}
