import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;


public class RecylcedNumbers {

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("input.in"));
		BufferedWriter bfrw = new BufferedWriter(new FileWriter("output.out"));
		
		long N = in.nextLong();
		String output = "";
		for(long i = 0; i < N;i++){
			long A = in.nextLong();
			long B = in.nextLong();
			
			output += "Case #"+(i+1)+": " + solve(A,B) + "\n";
		}
		
		bfrw.write(output);
		in.close();
		bfrw.close();
	}
	
	private static long solve(long A,long B){
		long ans = 0;
		if(B <= 9) return 0;
		HashSet<String> set = new HashSet<String>();
		for(long i = A; i <=B; i++){
			String s = i+"";
			
			for(int j = 0; j < s.length();j++){
				String one = s.substring(s.length()-j);
				String two = s.substring(0,s.length()-j);
	
				if(Integer.parseInt(one+two) <= B && i < Integer.parseInt(one+two)) {
					ans++;
					//System.out.println(s + " --> " + one + two);
					set.add(i+","+Integer.parseInt(one+two));
				}
			}
		}
		
		return set.size();
	}
}
