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;
	}

}

package cjam.c;

import java.awt.Checkbox;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;

public class Program {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		 java.io.BufferedReader stdin = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));
	      
	       try {
			int n = Integer.parseInt(stdin.readLine());
			 ArrayList<String> l = new ArrayList<String>();
			for (int i = 0; i < n; ++i){
				String[] spt = stdin.readLine().split(" ");
				int a = Integer.parseInt(spt[0]);
				int b = Integer.parseInt(spt[1]);
				
				int res = 0;
				for (int j = a; j <= b; ++j){
					for (int k = j+1; k <= b; ++k){
						if (check(j,k)){ res++;
//						check(j,k);
//						if (j == 178) {
//							int asd = 123;
//							check(j,k);
//							asd++;
//						}
//						System.out.println(j+" "+k);
						}
					}
				}
				l.add("Case #"+(i+1)+": "+res);
				
			}
			for (String s : l) {
		    	   System.out.println(s);
		       }
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	static boolean check(int a, int b){
		
		if (b <= a) return false;
		int x = 10;
		int n = 1;
		while (a/x > 0){
			n++;
			x *= 10;
		}

		//System.out.println(n);
		for (int i = 1; i < n; ++i){
			int c = a % pow(10,i);
			int f = pow(10,(n-i))*c;
			int g = a / pow(10,i);
			if ( f+g  == b) return true;
		}
		
		return false;
	}
	static int pow (int x, int n){
		int y = x;
		for (int i =0; i<n-1; ++i) y*=x;
		return y;
	}
}
