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

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam;
import java.util.*;
import java.io.*;
public class RecycledNumbers{
    public static void main(String[] args) throws Exception
    {
        Scanner input = new Scanner(new File("C:\\temp\\C-large.in"));
        int T = input.nextInt();
        for (int t = 1; t <= T; t++)
        {
        int A = input.nextInt();
        int B = input.nextInt();
        double answer = 0;
        for (int a = A; a <= B; a++)
        {
            String aS = a + "";
            for (int i = aS.length(); i > 1; i--)
            {
                int max = Integer.parseInt(aS.substring(i-1) + aS.substring(0, i-1));
                if (max <= B && max >= A && max != a)
                {
                   answer++;
                }
            }
        }
        System.out.println("Case #" + t + ": " + (int)(answer/2));
    }
    }
    public static String reverse(String s, int i)
    {
        return (i < s.length()) ? s.charAt(s.length()-1-i) + reverse(s, i+1) : "";
    }
}
