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 com.code.jam;

import java.io.File;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

import org.apache.commons.lang.StringUtils;

public class CRecycledNumbers {
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner (new File("C:/codeJam/ficheros2012/CRecycledNumbers.in"));
		PrintStream ps = new PrintStream("C:/codeJam/ficheros2012/CRecycledNumbers.out");
		int T = new Integer (in.nextLine());
		for (int nCase = 1; nCase < T + 1; nCase++) {
			Scanner inLine = new Scanner (in.nextLine());
			int recycledPair = 0;
			int A = inLine.nextInt();
			int B = inLine.nextInt();
			int lengthI = String.valueOf(A).length();
			
			if (lengthI > 1){
				for (int n = A; n <= B; n++){
					int operatorGetLeftRight = 1;
					int operatorNewNumber = Integer.valueOf(StringUtils.rightPad("1", lengthI + 1, '0'));
					Set<Integer> isRepeted = new HashSet<Integer>();
					for (int j = 1; j < lengthI; j++) {
						operatorGetLeftRight *= 10;
						operatorNewNumber /= 10;
						int newLeft = n % operatorGetLeftRight;
						int newRight = (n - newLeft) / operatorGetLeftRight;
						int m = newLeft * operatorNewNumber + newRight;
						if ( !(isRepeted.contains(m)) 
								&& (m >= A) 
								&& (m <= B) 
								&& (n < m)){
							isRepeted.add(m);
							recycledPair++;
						}
					}
				}
			}
			System.out.format("Case #%d: %d\n", nCase, recycledPair);
			ps.format("Case #%d: %d\n", nCase, recycledPair);
		}
		ps.flush();
		ps.close();
	}
}
