package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;


public class GoogleRecycler {
	public static void main(String args[]) throws IOException{
		Scanner scan = new Scanner(System.in);
		PrintWriter print = new PrintWriter(new FileWriter("GoogleRecycler.out"));
		Integer cases = Integer.parseInt(scan.nextLine());
		for(int i=0; i<cases; i++){
			long A = scan.nextLong();
			long B = scan.nextLong();
//			System.out.println("A: " + A + " B: " + B);
			int total = 0;
			
			for(long n = A; n < B; n++){
				for(long m = n+1; m <= B; m++){
					//System.out.println(n + ", " + m);
					if(check(n,m)){
						total++;
//						System.err.println(n + ", " + m );
					}
				}
			}
			print.println("Case #" + (i+1) + ": " + total);
			System.out.println("Case #" + (i+1) + ": " + total);
			
		}
		print.flush();
		print.close();
	}

	public static boolean check(long a, long b){
		String num1 = String.valueOf(a);
		String num2 = String.valueOf(b);
		
		if(num1.length() != num2.length()){
			System.err.println("ERROR!!!!!");
		}

		String part1 = "";
		String part2 = "";
		for(int i=0; i < num2.length(); i++ ){
			String sub = num2.substring(0,i);
			if(num1.contains(sub)){
				part1 = sub;
			}else{
				break;
			}
		}
		for(int i=part1.length(); i<= num1.length();i++){
			String sub = num2.substring(part1.length(), i);
			if(num1.contains(sub)){
				part2 = sub;
			}else{
				break;
			}
		}

		if(part1.length() + part2.length() != num1.length()){
			return false;
		}

		if(part2.concat(part1).equals(num1)){
			return true;
		}

		return false;
	}
}
