import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class Problem3 {
	
	
	public static String getNext(String input){
		char last = input.charAt(input.length() - 1);
		input = last + input.substring(0, input.length()-1);
		return input;
	}
	
	public static void main(String[] args) throws IOException{
		BufferedReader in = new BufferedReader(new FileReader("C-small.txt"));
		PrintWriter out = new PrintWriter("C-out.txt");
		int testCases = Integer.parseInt(in.readLine().trim());
		for (int i = 0; i < testCases; i++) {
			StringTokenizer tokenizer = new StringTokenizer(in.readLine());
			int start = Integer.parseInt(tokenizer.nextToken());
			int end = Integer.parseInt(tokenizer.nextToken());
			boolean map[] = new boolean[10000000];
			int count = 0;
			for (int j = start; j <= end; j++) {
				if(map[j]){
					continue;
				}
				String number = j + "";
				int tmpCount = 0;
				Set<Integer> set = new HashSet<Integer>();
				String prev = j + "";
				for (int k = 0; k < number.length(); k++) {
					String nextS = getNext(prev);
					int next = Integer.parseInt(nextS);
					if(next == j){
						continue;
					}
					if(set.contains(next)){
						continue;
					}
					
					if(next >= start && next <= end){
						map[next] = true;
						tmpCount++;
						set.add(next);
					}
					prev = nextS;
				}
				map[j] = true;
				if(tmpCount != 0){
					count += (tmpCount*(tmpCount+1))/2;
				}
			}
			out.println("Case #" + (i+1) + ": " + count);
		}
		out.close();
	}
}
