import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

/**
 * @(#)Main.java
 *
 *
 * @author 
 * @version 1.00 2012/4/14
 */
import java.io.*;

public class Main {
	
	public static void main(String...args)throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
        FileWriter fstream = new FileWriter("C-large.out");
        BufferedWriter out = new BufferedWriter(fstream);
        String in = br.readLine();
        int testCases = Integer.parseInt(in);
        int i = 1;
        
        while(testCases > 0) {
        	in = br.readLine();
        	out.write("Case #" + i + ": " + solve(in) + "\n");
        	testCases--;
        	i++;
        }
        out.close();
	}
	
	public static int solve(String in) {
		String[] data = in.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		
		int solution = 0;
		
		for(int i = a; i < b; i++) {
			int tmp = i;
			
			do{
				tmp = shift(tmp);
				while (Math.floor(Math.log10(i)) != Math.floor(Math.log10(tmp))){
					tmp *= 10;
				}
				if(tmp > i && tmp <= b){
					solution++;
				}
			}while(tmp != i);
		}
		return solution;
	}
	
	public static int shift(int a){
		int E = firstDigit(a);
		int T = 10 * trailing(a);
		return E + T;
	}
	
	public static int trailing(int x) {
		if (x == 0) return 0;
		return (int) Math.floor(x % Math.pow(10, Math.floor(Math.log10(x))));
	}
	
	public static int firstDigit(int x) {
  		if (x == 0) return 0;
  		return (int) Math.floor(x / Math.pow(10, Math.floor(Math.log10(x))));
	}
    
}