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

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class RecycledNumbers {
//	private static String INPUT_FILE = "input.txt";
	private static String INPUT_FILE = "C-small-attempt0.in";
	
	
	private static final String DELIM = " ";
	
	public void solve() {
		try {
			BufferedReader in = new BufferedReader(new FileReader(INPUT_FILE));
			
			int T = Integer.valueOf(in.readLine());
			
			String line;
			for(int i = 0; i < T; i++) {
				line = in.readLine();
				
				StringTokenizer st = new StringTokenizer(line, DELIM);
				
				int A = Integer.valueOf(st.nextToken());
				int B = Integer.valueOf(st.nextToken());
				
				process(i + 1, A, B);
			}
		}
		catch(Exception e) {}
	}
	
	protected void process(int idx, int A, int B) {
		int cnt = 0;
		
		String digit;
		int len;
		StringBuffer sb;
		String r;
		int d;
		LinkedList<String> list = new LinkedList<String>();
		String pair;
		
		for(int i = A; i <= B; i++) {
			digit = Integer.toString(i);
			len = digit.length();
			
			if(len > 1 && !digit.endsWith("0")) {
				for(int j = 1; j <= len - 1; j++) {
					sb = new StringBuffer();
					sb.append(digit.substring(len - j, len));
					sb.append(digit.substring(0, len - j));
					
					r = sb.toString();
					
					if(r.charAt(0) != '0' && !r.equals(digit)) {
						d = Integer.valueOf(r);
						
						if(d >= A && d <= B) {
							if(i < d)
								pair = i + "|" + d;
							else
								pair = d + "|" + i;
							
							if(!list.contains(pair)) {
								list.add(pair);
								cnt++;
							}
						}
					}
				}
			}
		}
		
		System.out.println("Case #" + idx + ": " + cnt);
	}
	
	public static void main(String[] args) {
		RecycledNumbers r = new RecycledNumbers();
		r.solve();
	}

}
