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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class C {
    public static void main (String [] args) throws FileNotFoundException {
        Scanner input = new Scanner(new File("csmall.in"));
        int count = input.nextInt();
        for (int i = 0; i < count; i++) {
            int A = input.nextInt();
            int B = input.nextInt();
            System.out.println("Case #" + (i+1) + ": " + doWork(A, B));
        }
    }
    
    private static int doWork(int a, int b) {
        int count = 0;
        int n = a;
        int m = a + 1;
        while (m <= b) {
            n = a;
            while (n < m) {
                if (checkRotation(Integer.toString(n), Integer.toString(m)))
                    count++;             
                n++;
            }
            m++;
        }
        return count;
    }

    private static boolean checkRotation(String given, String toCheck) {
        char [] giv = given.toCharArray();
        char [] temp = new char[giv.length + 1];
        int i , j , n;
        n = temp.length - 1;
        for (i = 0; i < giv.length; i++) {
            temp[i] = giv[i];
        }
        for(i = 0; i < given.length(); i++)
        {
            temp[n] = temp[0];

            for(j = 0; j < n; j++)
            {
                temp[j] = temp[j+1];
            }
            char[] moreTemp = new char[giv.length];
            for (int k = 0; k < giv.length; k++) {
                moreTemp[k] = temp[k];
            }
            if ((new String(moreTemp)).equals(toCheck)) {
                return true;
            }
            //System.out.printf("\n %s", new String(moreTemp));
        }
        return false;
    }
}
