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.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.Writer;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;


public class RecycledNumbers {

	public static void main(String[] args) {

		if (args.length != 2) {
			System.out.println("Usage: java RecycledNumbers <input-file> <output-file>");
			System.exit(0);
		}
		
		try {
			
			RecycledCounter counter = 
					new RecycledCounter(new FileReader(args[0]), new FileWriter(args[1]));
			counter.count();
			
		} catch (Exception e) {
			
			System.out.println("Sorry, there was a fatal error:");
			e.printStackTrace();
			System.exit(0);
		}
	}
}

class RecycledCounter {
	
	private final BufferedReader reader;
	private final PrintWriter writer;
	
	public RecycledCounter(Reader in, Writer out) throws IOException {
		
		reader = new BufferedReader(in);
		writer = new PrintWriter(out);
	}
	
	public void count() throws IOException {
		
		String line = reader.readLine();
		int numTests = Integer.parseInt(line);
		
		for (int i = 0; i < numTests; i++) {
			
			line = reader.readLine();
			writer.printf("Case #%d: %s", i + 1, countNumberOfRecycledPairs(line));
			writer.println();
		}
		
		writer.flush();
		writer.close();
		reader.close();
	}
	
	public int countNumberOfRecycledPairs(String line) {
		
		String[] tokens = line.split(" ");
		int a = Integer.parseInt(tokens[0]);
		int b = Integer.parseInt(tokens[1]);
		
		int y = 0;
		Set<String> distinct = new HashSet<String>();
		
		for (; a <= b; a++) {
			
			if (a < 10) {
				continue;
			}
			
			String num = String.valueOf(a);
			for (int i = num.length() - 1; i > 0; i--) {
				String recycledNum = num.substring(i) + num.substring(0, i);
				if (recycledNum.startsWith("0")) {
					continue;
				}
				int recycled = Integer.valueOf(recycledNum);
				if (recycled >= a && recycled <= b && a < recycled && !distinct.contains(num + recycledNum)) {
					distinct.add(num + recycledNum);
					y++;
				}
			}
		}
		
		return y;
	}
}
