/*
 * 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);
        
    }
    }
}

/**
 * @author ShengMin Zhang
 * @revision 1.0
 * - brute force naive solution to make it work for the small input size
 */
 
import java.io.*;
import java.util.*;

public class Sample {
	boolean isRecycledPair(int n, int m) {
		String sn = Integer.toString(n);
		String sm = Integer.toString(m);
		
		if(sn.length() != sm.length()) return false;
		
		for(int i = 1; i < sn.length(); i++) {
			
			String newString = sn.substring(i) + sn.substring(0, i);
			if(newString.equals(sm)) return true;
		}
		
		return false;
	}

	int solve (int A, int B) {
		int count = 0;
		for(int n = A; n < B; n++) {
			for(int m = n + 1; m <= B; m++) {
				if(isRecycledPair(n, m)) count++;
			}
		}
		
		return count;
	}

	void run(BufferedReader rd) throws Exception {
		int T = Integer.parseInt(rd.readLine());
		PrintWriter writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		
		for(int i = 1; i <= T; i++) {
			StringTokenizer st = new StringTokenizer(rd.readLine());
			int A = Integer.parseInt(st.nextToken());
			int B = Integer.parseInt(st.nextToken());
			
			writer.printf("Case #%d: %d", i, solve(A, B));
			writer.println();
		}
		
		rd.close();
		writer.close();
	}

	public static void main(String[] args) throws Exception {
		BufferedReader rd = new BufferedReader(new InputStreamReader(System.in));
		new Sample().run(rd);
	}
}
