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();
    }
}

package recycled;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Recycle {
	public static void main(String[] args)throws IOException {
		BufferedWriter saida = new BufferedWriter(new FileWriter("saida.out"));
		File file = new File("C-large.in");
		Scanner scan = new Scanner(file);
		int casos;
		String a;
		String b;
		String linha;
		String[] divisao;
		String novo;
		ArrayList<String> list = new ArrayList<String>();
		int tamanhoN;
		casos = Integer.parseInt(scan.nextLine());
		String n;
		String m;
		for (int  i =1; i <= casos;i++){
			saida.write("Case #" + i + ": ");
			int pares = 0;
			linha = scan.nextLine();
			divisao = linha.split("\\s+");

			a = divisao[0];
			b = divisao[1];

			n = a;
			do{
				m = n;
				tamanhoN = n.length();
				for(int j = 0; j < tamanhoN;j++){
					m = desloca(m);
					novo = ("(" + n + "," + m + ") ");
					if(!(list.contains(novo))){
						if(Long.parseLong(a) <= Long.parseLong(n) && Long.parseLong(n) < Long.parseLong(m) && Long.parseLong(m) <= Long.parseLong(b)){
							pares++;
						}
					}
				}
				n = String.valueOf(Long.parseLong(n) + 1);
			}while(Long.parseLong(n) < Long.parseLong(b));
			System.out.println(pares);
			saida.write(pares + "");
			saida.newLine();
		}
		
		if (saida != null){
			saida.flush();
			saida.close();
		}

	}
	
	public static String desloca(String n){
		StringBuffer temp = new StringBuffer(n);
		char primeiro = n.charAt(0);
		for (int j=1; j < temp.length(); j++)
		{
			char c = n.charAt(j);
			temp.setCharAt(j-1, c);
		}
		temp.setCharAt(n.length()-1, primeiro);
		
		n = temp.toString();
		return n;
	}
	
}
