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();
		}
	}
}

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


public class C {
    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        
        int cases;
        cases = in.nextInt();
        in.nextLine();
        
        for(int i = 0; i < cases; i ++ ) {
            int a = in.nextInt();
            int b = in.nextInt();
            HashSet<Integer> found = new HashSet<Integer>();
            int total = 0;
            if( b >= 10) {
                if( a < 10 ) {
                    a = 10;
                }
                for( int j = a; j <= b; j++ ) {
                    if( !found.contains(j) ) {
                        String theNum = String.valueOf(j);
                        int morphed;
                        theNum = theNum.charAt(theNum.length() -1) + theNum.substring(0, theNum.length()-1);
                        morphed = Integer.valueOf(theNum);
                        while( morphed != j ) {
                            if( !found.contains(morphed) &&
                                    morphed >=a && morphed <=b ) {
                                total ++;
                                found.add(j);
                            }
                            theNum = theNum.charAt(theNum.length() -1) + theNum.substring(0, theNum.length()-1);
                            morphed = Integer.valueOf(theNum);
                        }
                    }
                }
            }
            System.out.println("Case #" + (i+1) + ": " + total );
        }
    }
}
