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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class codejamp3 {
	public static char[] map;
	public static void main(String[] args) throws IOException{
		readFile();
	}

	public static String getResult(String input){
		int resultInt = 0;
		Set<Integer> exist = new HashSet<Integer>();
		String[] splitResult = input.split(" ");
		int numberA = Integer.parseInt(splitResult[0]);
		int numberB = Integer.parseInt(splitResult[1]);
		for(int i = numberA; i < numberB; i++){
			int current = i;
			exist.clear();
			int length1 = String.valueOf(current).length();
			int j = 10;
			while(j<=current){
				int remain = current%j;
				int length2 = String.valueOf(j).length(); 
				double b = Math.pow(10, length2-1);
				double a = Math.pow(10,length1);
				int currentResult = (int)(remain*a/b+current/j);
				if(current == 2022){
					System.out.println(remain+":"+(length2-1)+":"+currentResult);
				}
				if(currentResult <= numberB && currentResult > current){
					if(!exist.contains(currentResult)){
						exist.add(currentResult);
						resultInt++;
					}
				}
				j = j*10;
			}
		}
		return ""+resultInt;
	}
	public static void readFile() throws IOException{
			FileWriter fstream = new FileWriter("out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
            FileReader input = new FileReader("in.txt");
            BufferedReader bufRead = new BufferedReader(input);	
            String line = bufRead.readLine();
            String current = getResult(line);
            int i = 1;
            out.write("Case #" + i + ": " + current);
            line = bufRead.readLine();
            while (line != null){
            	i++;
          	  	out.write('\n' + "Case #" + i + ": " + getResult(line));
          	  	line = bufRead.readLine();
            }             
            bufRead.close();
            out.close();
	}
}
