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

public class C {
		
	public static void main(String[] args){
		
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt();
		in.nextLine();
		
		for(int line = 1; line <= T; line++){ // loop through lines
			String numbers = in.nextLine();
			int spaceIndex = numbers.indexOf(' ');
			int lowerLimit = Integer.parseInt(numbers.substring(0, spaceIndex));
			int upperLimit = Integer.parseInt(numbers.substring(spaceIndex + 1));
			int numberOfDigits = spaceIndex;
			
			int pairs = 0;
			for(int swooper = lowerLimit; swooper < upperLimit; swooper++){
				for(int cycler = swooper + 1; cycler <= upperLimit; cycler++){
					// Convert to char array for manipulation
					char[] digits = Integer.toString(cycler).toCharArray();
					for(int offset = 1; offset < numberOfDigits; offset++){
						// Rotate
						char firstElement = digits[0];
						for(int i = 0; i < numberOfDigits - 1; i++){
							digits[i] = digits[i+1];
						}
						digits[numberOfDigits - 1] = firstElement;
						// Convert back to an int and compare
						int cycledCycler = Integer.parseInt(new String(digits));
						if(cycledCycler == swooper){
							//System.out.format("A match! %d and %d!\n", swooper, cycler);
							pairs++;
							break;
						}
					}
				}
			}
			
			System.out.format("Case #%d: %d\n", line, pairs);
		}
	}
}
