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

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.util.Scanner;
import java.io.*;
import java.util.HashSet;
import java.util.LinkedList;


public final class problem2 {

	public static HashSet <String> hash;
	
	public static String decode(int min, int max){
		int total = 0;
		hash = new HashSet <String>();
		
		try{
			//FileWriter fw = new FileWriter("final1.txt");
			
			for(int i = min ; i <= max ; i++){
				String n = Integer.toString(i);
				int len = n.length();
				n = n.concat(n);
				
				int count = 0;
				for(int j = 0 ; j <= len ; j++){
					String tmp = n.substring(j, j+len);
					
					if(tmp.charAt(0) != '0'){
						int m = Integer.valueOf(tmp);
						
						if(m >= min && m <= max){
							if(!hash.contains(tmp)){
								hash.add(tmp);
								count++;
								//fw.write(tmp + "\n");
							}
						}
					}
				
				}
				
				if(count > 1)
					count = count * (count - 1) / 2;
				else
					count = 0;
				
				total += count;
			
			}
			//fw.write(total);
			//fw.close();
			
			
		}catch(Exception e){}
		
		return Integer.toString(total);
		
	}


	
	public static void main(String[] args){

		try{
			//Scanner sc = new Scanner(new File("yo.txt"));
			Scanner sc = new Scanner(new File("C-large.in"));
			FileWriter fw = new FileWriter("Large.txt");
		
		
			String tmp = sc.nextLine();
			int step = Integer.valueOf(tmp);
		
			int counter = 1;
			while(sc.hasNextLine()){
				//System.out.print("Case #" + counter + ": "); 
				
				String s = sc.nextLine();
				Scanner ssc = new Scanner(s);
				int A = ssc.nextInt();
				int B = ssc.nextInt();
				
				
				//System.out.println(A + " " + B); 
				String xx = decode(A, B);
				System.out.println("Case #" + counter + ": " + xx);
				fw.write("Case #" + counter + ": " + xx);
				fw.write("\n");
				counter++;
				if(step < counter)
					break;
			}
			fw.close();
		}catch(Exception e){}
		
	}
	
}