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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class RecycledNumbers {
	
	public static File input;
	public static FileReader inputReader;
	public static BufferedReader in;
	
	public static File output;
	public static FileWriter outputWriter;
	public static BufferedWriter out;
	
	private static void init(String problemName) throws IOException {
		input = new File(problemName+".in");
		inputReader = new FileReader(input);
		in = new BufferedReader(inputReader);
		
		output = new File(problemName+".out");
		outputWriter = new FileWriter(output);
		out = new BufferedWriter(outputWriter);
	}
	
	public static int INT() throws IOException {
		return Integer.parseInt(in.readLine());
	}
	
	public static String LINE() throws IOException {
		return in.readLine();
	}
	
	public static void main(String[] args) throws IOException {
		init("recycled-numbers");
		
		int cases = INT();
		for(int i = 1; i <= cases; i++) {
			String[] bounds = LINE().split("\\s");
			int A = Integer.parseInt(bounds[0]);
			int B = Integer.parseInt(bounds[1]);
			
			Set<String> pairs = new HashSet<String>();
			
			for(int x = A; x<=B; x++) {
				String n = String.valueOf(x);
				int digits = n.length();
				if(digits > 1) {
					for(int p = 1; p < digits; p++) {
						String m = n.substring(n.length()-p)+n.substring(0,n.length()-p);
						int mN = Integer.parseInt(m);
						if(m.startsWith("0") || !(mN >= A && mN <=B)){
							continue;
						} else {
							if(x < mN){
								pairs.add("("+n+","+m+")");
							}
						}
					}
				}
			}
			
			System.out.println("Case #"+i+": "+pairs.size());
			out.write("Case #"+i+": "+pairs.size());
			out.newLine();
		}
		
		out.flush();
		out.close();
		in.close();
	}
}
