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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * 
 */

/**
 * @author Bageshwar
 * 
 */
public class Recycle {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		
		long[] p = new long[] { 10, 100, 1000, 10000, 100000, 1000000, 10000000 };
		// HashSet<Long> set=new HashSet<Long>();

		// HashSet<String> set1=new HashSet<String>();

		BufferedReader fr = new BufferedReader(new FileReader(new File(args[0])));
		String str = fr.readLine();
		//System.out.println(str);
		int lines = Integer.parseInt(str);
		FileWriter writer = new FileWriter(new File(args[1]));
		StringTokenizer stk;
		for (int l = 0; l < lines; l++) {

			writer.write("Case #"+(l+1)+": ");
			str = fr.readLine();
			stk = new StringTokenizer(str," ");			
			
			long a = Integer.parseInt(stk.nextElement().toString());
			long b = Integer.parseInt(stk.nextElement().toString());
			int total = 0;
			long t = 0;
			int k = 0;
			int c = ("" + b).length() - 1;
			for (long i = a; i <= b; i++) {

				for (int j = 0; j < c; j++) {
					// rotate by j
					// j=j-1;
					k = c - j - 1;
					t = (i % p[j]) * p[k] + (i / p[j]);
					 System.out.print(" "+i+":"+t);
					if (t <= b && t >= a && i != t) {
						 System.out.print("!");
						// set.add(i);
						total++;
						//System.out.println("##########" + i + ">>" + t);
						// set1.add(e)
					}
				}
				System.out.println("");
			}

			System.out.println(total);
			System.out.println(total / 2);
			writer.write(total/2+"\r\n");
		}
		writer.close();
		fr.close();
	}

}
