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.*;
import java.io.*;

public class ProblemC {
	public static void main(String[] args){
		try{
			//Scanner scan = new Scanner(new File("C-small-attempt0.in"));
			Scanner scan = new Scanner(new File("C-small-attempt0.in"));
			int nLines = scan.nextInt();
			scan.nextLine();
			for(int testCase = 1; testCase <= nLines; testCase++){
				int x = scan.nextInt();
				int y = scan.nextInt();
				int recycled = 0;
				for(int a = x; a < y; a++){
					for(int b = a+1; b <= y; b++){
						if(isRecycled(a, b)){
							recycled++;
						}
					}
				}
				System.out.printf("Case #%d: %d\n", testCase, recycled);
			}
		} catch(FileNotFoundException fnfe){
			System.err.println("File Not Found");
		}
	}
	
	public static boolean isRecycled(int a, int b){
		String aStr = "" + a;
		String bStr = "" + b;
		char firstChar = aStr.charAt(0);
		int strLen = aStr.length();
		int startIndex = bStr.indexOf(firstChar);
		while(startIndex >= 0){
			if(testLocation(aStr, bStr, startIndex)){
				return true;
			}
			
			if(startIndex < (strLen-1)){
				int newIndex = bStr.substring(startIndex + 1).indexOf(firstChar);
				if(newIndex >= 0){
					startIndex += newIndex + 1;
				} else {
					break;
				}
			} else {
				startIndex = -1;
			}
		}
		return false;
	}
	
	public static boolean testLocation(String a, String b, int startPos){
		for(int i = 0; i<a.length(); i++){
			if(a.charAt(i) != b.charAt((i + startPos) %  b.length())){
				return false;
			}
		}
		return true;
	}
}