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.*;

public class mains {
	public static void main(String[] args) {
		BufferedReader input;
		BufferedWriter output;
		
		try {
			input = new BufferedReader(new FileReader("C-small-attempt0.in"));
			output = new BufferedWriter(new FileWriter("output.out"));
			
			int caseCount = Integer.parseInt(input.readLine());
			
			String buf;
			String[] values;
			int minValue;
			int maxValue;
			int currentValue;
			int highest;
			int next;
			int result = 0;
			int numLength;
			
			for(int index = 1 ; index <= caseCount; ++index) {
				buf = input.readLine();
				values = buf.split(" ");
				
				minValue = Integer.parseInt(values[0]);
				maxValue = Integer.parseInt(values[1]);
				
				numLength = values[1].length();
				highest = (int)Math.pow(10, numLength - 1);
				result = 0;
				if(highest != 1) {
					for(int num = minValue; num <= maxValue ; ++num) {
						currentValue = num;
						for(int i = 0 ; i < numLength ; ++i) {
							next = currentValue / highest;
							currentValue %= highest;
							currentValue *= 10;
							currentValue += next;
							
							if(num < currentValue && currentValue <= maxValue)
								++result;
						}
					}
					
					output.write("Case #" + index + ": " + result);
					output.newLine();
				} else {
					output.write("Case #" + index + ": 0");
					output.newLine();
				}
			}
			
			output.close();
			input.close();
		} catch(Exception e) {
			return;
		}
	}
}
