/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.File;
import java.io.FileInputStream;
import java.util.Scanner;

/**
 *
 * @author imgps
 */
public class C {
    public static void main(String args[]) throws Exception{
        int A,B;
        int ctr = 0;
        int testCases;
        
        Scanner sc = new Scanner(new FileInputStream("C-small-attempt0.in "));
        testCases = sc.nextInt();
        int input[][] = new int[testCases][2];
        for(int i=0;i<testCases;i++)
        {
          //  System.out.print("Enter input A B: ");
            input[i][0] = sc.nextInt();
            input[i][1] = sc.nextInt();
            
        }
  

for(int k=0;k<testCases;k++){
      ctr = 0;
      A = input[k][0];
      B = input[k][1];
        for(int i = A;i<=B;i++){
            int num = i;
            int nMul = 1;
            int mul = 1; 
            int tnum = num/10;
            while(tnum > 0){
                mul = mul *10;
                tnum= tnum/10;
            }
            tnum = num;
            int n = 0;
            while(tnum > 0 && mul >= 10){
                nMul = nMul * 10;
                n = (num % nMul) * mul + (num / nMul);
                mul = mul / 10;
                tnum = tnum / 10;
                for(int m=num;m<=B;m++){
                    
                    if(n == m && m > num){
                        ctr++;
                    }
                }
                
                
                
         
            }
        }
        System.out.println("Case #"+(k+1)+": "+ctr);
        
    }
    }
}

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


public class RecycledNumbers {
	static boolean isRecycled(int a, int b, int length) {
		String aString = String.valueOf(a);
		String bString = String.valueOf(b);
		
		for (int i = 0; i < length - 1; i++) {
//			System.out.println(aString.substring(length - 1 - i) + aString.substring(0, length - 1 - i));
			if (bString.equals(aString.substring(length - 1 - i) + aString.substring(0, length - 1 - i))) {
				return true;
			}
		}
		return false;
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int testCases = Integer.parseInt(br.readLine());
		HashMap<Integer, Integer> lengths = new HashMap<Integer,Integer>();
		for (int i = 1; i <= 2000000; i++) {
			lengths.put(i, String.valueOf(i).length());
		}
		for (int t = 1; t <= testCases; t++) {
			String[] ab  = br.readLine().split(" ");
			int a = Integer.parseInt(ab[0]);
			int b = Integer.parseInt(ab[1]);
			int aLog = ab[0].length() - 1;
			int bLog = ab[1].length() - 1;
			
			int count = 0;
			for (int i = a; i <= b; i++) {
				int iLength = lengths.get(i);
				for (int j = i + 1; j <= b; j++) {
					if (iLength != lengths.get(j)) {
						break;
					}
					if (isRecycled(i, j, iLength)) {
						count++;
					}
				}
			}
			
			
			System.out.println("Case #" + t + ": " + count);
			
		}
	}
}
