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

public class RecycledNumbers {

private static ArrayList<String> A,B; 

public static void main(String[] args) throws Exception {

File in = new File("C-small-attempt0.in");
File out = new File("out.txt");
RecycledNumbers.read(in);
RecycledNumbers.print(out);


}
 

public static void read (File file) throws FileNotFoundException {
 Scanner scanner = new Scanner (file);
 int cases = scanner.nextInt();
 A = new ArrayList<String>(cases);
 B = new ArrayList<String>(cases);
 while (scanner.hasNext()) {
    A.add(scanner.next());
    B.add(scanner.next());    
 }
}
 
public static void print (File file) throws FileNotFoundException {
 PrintStream fileStream = new PrintStream (file);
 for (int i = 0; i < A.size(); i++) {
    //fileStream.println(A.get(i) + " " + B.get(i));
    fileStream.println("Case #" + (i+1) +": " + test(A.get(i),B.get(i)));
 }
fileStream.close();
}

public static int test(String A, String B) {

int returnThis = 0;

if (A.length() == 1) {
   return 0;
}

   int limit = Integer.valueOf(B); 
   int start = Integer.valueOf(A);
   for (int i = start; i <= limit; i++) {
      String base = Integer.toString(i);
      int count = 1;
      String m = "" + base.charAt(base.length() - count); 
      while (true) {                  
         String out = m + base.substring(0, base.length() - count);
         //System.out.println(base+": " + out);
         if (verify(base, out, limit)) {
           // System.out.println("A: "+A +" B: " + B + " base: " + base +" out: " + out);
            returnThis++;
         }
         count++;
         if (base.length() <= count) break;
         if (base.equals(out)) break;
         m = base.charAt(base.length() - count) + m;  
      }     
   }
//System.out.println(returnThis);
return returnThis;
}

public static boolean verify(String n, String m, int limit) {
   if (m.charAt(0) == '0') return false;
   if (Integer.valueOf(n) < Integer.valueOf(m) && Integer.valueOf(m) <= limit) {
      return true;
   }
return false;
}

}
