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.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class TestGoogle3 {

	public TestGoogle3() {
		try {
			// Open the file that is the first
			// command line parameter
			FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			int line = -1;
			int curline = 0;
			// Read File Line By Line
			while ((strLine = br.readLine()) != null) {
				// Print the content on the console
				if (line == -1)
					line = Integer.parseInt(strLine);
				else if (curline < line) {
					System.out.print("Case #" + ++curline + ": ");
					System.out.println(this.calculate(strLine));
				}
			}
			in.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}

	}

	public int calculate(String input) {

		String[] result = input.split("\\s");
		int n = Integer.parseInt(result[0]);
		int s = Integer.parseInt(result[1]);

		return getRecycledNumber(n, s);

	}

	public int getRecycledNumber(int low, int high) {

		int counter = 0;
		ArrayList<Integer> list = new ArrayList<Integer>();
		for (int i = low; i < high; i++) {
			int li = i;
			// System.out.println("cleared:");

			list.clear();
			while (li > 0) {
				list.add(li % 10);
				li = li / 10;
			}

			int[] temp = new int[list.size()];

			for (int j = 0; j < list.size(); j++) {
				// System.out.println("current number:" + list.get(j));
				for (int k = 0; k < list.size(); k++) {
					temp[k] = (int) (temp[k] + list.get(j)
							* (Math.pow(10, ((k + list.size() + j) % list
									.size()))));
				}
			}

			for (int m = 0; m < list.size(); m++) {

				if (temp[m] > i && temp[m] <= high) {
					boolean flag = false;
					// skip duplicates
					for (int n = 0; n < m; n++) {
						if (temp[m] == temp[n]) {
							System.out.println("i " + i);
							System.out.println("duplicate" + i);
							flag = true;
						}
					}
					if (!flag)
						counter++;

				}
			}
		}
		return counter;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new TestGoogle3();

	}

}
