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 google.jam.code;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 * @author walir
 *
 */
public class RecycledNumbers {

	private BufferedReader bufferedReader;

	public RecycledNumbers() throws FileNotFoundException {
		File file = new File("C:/test");
		InputStreamReader in = new InputStreamReader(new FileInputStream(file));
		bufferedReader = new BufferedReader(in);
	}

	public static void main(String[] args) throws NumberFormatException, IOException{
		RecycledNumbers  recycledNumbers = new RecycledNumbers();
		recycledNumbers.bp();
	}

	private void bp() throws NumberFormatException, IOException {
		int numberOfCases = Integer.valueOf(bufferedReader.readLine());

		for (int i = 1; i <= numberOfCases; i++) {
			String s[] = bufferedReader.readLine().split(" ");
			Integer lLim = Integer.valueOf(s[0]);
			Integer uLim = Integer.valueOf(s[1]);
			int res = calc(lLim, uLim);
			System.out.println("Case #" + i + ": " + res);
		}
		
	}

	private int calc(Integer lLim, Integer uLim) {
		int total = 0;
		for(int l = lLim;l<uLim;l++){
			for(int u = lLim;u<=uLim;u++){
				if(l<u && recycleable(l,u))
					total++;
			}
		}
		return total;
	}

	private boolean recycleable(int l, int u) {
		int temp = l;
		
		int d = 0;
		while(temp>0){
			temp /= 10;
			d++;
		}
		int a[]=new int[d];
		for(int i=0;i<d;i++){
			int t = (int) (u%10);
			u /= 10;
			a[d-1-i] = t;
			
		}
		for(int s = 1; s < d; s++){
			int b  = shift(a, s);
			if((l ^ b) == 0)
				return true;
		}
		return false;
	}

	private int shift(int[] a, int s) {
		int r = 0;
		int l = a.length;
		for(int i=0;i<l;i++){
			r = r*10 + a[(s+i)%l];
		}
		//System.out.println(r);
		return r;
	}

}
