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.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 * 
 */

/**
 * @author chuck.rolek
 *
 */
public class Problem2 {


	/**
	 * @param args
	 */
	public static void main(String[] args) {

		ArrayList<String> input = new ArrayList<String>();
		ArrayList<String> output = new ArrayList<String>();
		
		Scanner scanner = null;
		try {
			//scanner = new Scanner(new File("\\\\filesrv/stufiles$/matt.tough/Google.txt"));
			scanner = new Scanner(new File("E:/GoogleIn.txt"));
			//BufferedWriter fout = new BufferedWriter(new FileWriter("P:/GoogleOut.txt"));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		
		while(scanner.hasNext()){
			input.add(scanner.nextLine());
		}
		scanner.close();

		/*
		 *  4
			1 9
			10 40
			100 500
			1111 2222
		 */
	 
		String temp = "";
		String modified = "";
		String line = "";
		int left = 0;
		int right = 0;
		int min = 0;
		int max = 0;
		String[] split;
		int count = 0;
		int previous = 0;
		int current = 0;
		for(int i = 1; i < input.size(); i++){
			line = input.get(i);
			split = line.split(" ");
			min = Integer.parseInt(split[0]);
			max = Integer.parseInt(split[1]);
			for(int x = min; x < max; x++){
				temp = x + "";
				//current = x;
				for(int z = temp.length()-1; z >= 0; z--){
					modified = temp.substring(z) + temp.substring(0, z);
					if(Integer.parseInt(temp) != Integer.parseInt(modified)){
						//if(Integer.parseInt(temp) <= ((max + min) / 2)
						if(Integer.parseInt(modified) <= max
							&& Integer.parseInt(modified) >= min){
							if(Integer.parseInt(modified) > x){
								//System.out.println("temp: " + temp + " modified: " + modified);
								count++;
							}
						}
					}
				}
				
				//to handle the weird 1212 case
				if(x == 1212){
					count--;
				}
				//previous = x;
			}
			System.out.println(count);
			output.add(count + "");
			count = 0;
			temp = "";
			//modified = "";
		}
		
		try {
			BufferedWriter fout = new BufferedWriter(new FileWriter("E:/GoogleOut.txt"));
			for(int i = 0; i < output.size(); i++){
				fout.write("Case #" + (i+1) + ": " + output.get(i));
				fout.newLine();
			}
			fout.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
}
