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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;

public class recycled {

    static void print(int nbCases, int N, int S, int P, int[] T) {
	System.out.print(N + " ");
	System.out.print(S + " ");
	System.out.print(P);
	for (int j = 0; j < N; j++)
	{
	    System.out.print(" " + T[j]);
	}
	System.out.println();
    }

    static int RecycledNumbers(int A, int B) {
	int res = 0;
	double d = Math.log10(A);
	int n = (int) Math.floor(Math.log10(A)) + 1;
	// System.out.println(" A = " + A + "B = " + B);
	// System.out.println(" N = " + n + " pour d = " + d);
	int flag = 0;
	HashSet<Couple> l = new HashSet<Couple>();
	for (int i = A; i <= B; i++)
	{
	    for (int j = 1; j < n; j++)
	    {
		int p = (int) (((int) Math.pow(10, n - j)) *
		               (i % (int) Math.pow(10, j)) + i /
		                                             Math.pow(10, j));
		if (i < p && p >= A && p <= B && p / Math.pow(10, n) != 0 && !l.contains(new Couple(i, p)))
		{
		    flag += 1;
		    res += 1;
		    l.add(new Couple(i,p));
		    //if (flag >1)
		    //	System.out.println("FLAG");
		    //System.out.println(" Couple : (" + i + ", " + p + ")");
		}
		
	    }
	    flag = 0;
	}
	return res;
    }
    static void run(int A, int B, int turn) {
	System.out.println("Case #" + turn + ": " + RecycledNumbers(A, B));
    }

    /**
     * @param args
     * @throws FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException {
	Scanner f = new Scanner(
	        new File(
	                "C:\\Users\\Jean-Baptiste\\Desktop\\Info2A\\GoogleJam\\src\\Recycled.in"));
	int nbCases = f.nextInt();
	int A = 1;
	int B = 1;

	for (int i = 0; i < nbCases; i++)
	{
	    A = f.nextInt();
	    B = f.nextInt();

	    run(A, B, i + 1);
	}

	int n = 6;
	int i = 123456;
	int j = 4;
	int p = (int) (((int) Math.pow(10, n - j)) *
	               (i % (int) Math.pow(10, j)) + i / Math.pow(10, j));
	//System.out.println(" Pour i = 123456 et j = 3 : " + p);
	f.close();
    }

}
