import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;

public class C
{
    Scanner in;
    PrintWriter out;
    PrintStream err;
    
    private boolean recycled(int x, int y) {
    	String s1 = Integer.toString(x);
    	String s2 = Integer.toString(y);
    	if (s1.length() != s2.length())
    		return false;
    	for (int i = 0; i < s1.length(); ++i)
    		if (s1.equals(s2.substring(i) + s2.substring(0, i)))
    			return true;
    	return false;
    }
 
    private void run() throws Exception
    {
    	//in  = new Scanner(System.in);
    	//out = new PrintWriter(System.out);
        //in = new Scanner(new FileInputStream(		new File("input")));
        in = new Scanner(new FileInputStream(		new File("C-small-attempt0.in")));
        //in = new Scanner(new FileInputStream(		new File("X-large.in")));
        out = new PrintWriter(new FileOutputStream(	new File("output")));
        err = System.out;

        int testCases = in.nextInt();

        for (int test = 1; test <= testCases; ++test) {
        	int a = in.nextInt();
        	int b = in.nextInt();
        	int result = 0;
        	for (int i = a; i <= b; ++i)
        		for (int j = i+1; j <= b; ++j)
        			if (recycled(i, j))
        				result++;
        	out.println("Case #" + test + ": " + result);
        }
        out.close();
    }

    public static void main(String[] args) throws Exception
    {
        new C().run();
    }
}