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

public class Ejercicio31 {

	DataInputStream entrada;
	ArrayList<String> datos;

	public Ejercicio31() {
		// TODO Auto-generated constructor stu

		datos = new ArrayList<String>();

	}

	public void extraer() {

		try {
			entrada = new DataInputStream(new FileInputStream("C-small-attempt0.in"));

			String cadena = "";

			while ((cadena = entrada.readLine()) != null) {

				datos.add(cadena);
			}

			entrada.close();

		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	public void encontrar() {

		 int entradas = Integer.parseInt(datos.get(0));
		//int entradas = 2;

		for (int i = 1; i <= entradas; i++) {

			String partes[] = datos.get(i).split(" ");

			int a = Integer.parseInt(partes[0]);
			int b = Integer.parseInt(partes[1]);

			int n = a;
			int m = a + 1;

			//System.out.print(n + " ");
			//System.out.println(m);
			//System.out.println();

			int nr = 0;

			while (n < m) {

				int mAuxNum = m;

				while (m <= b) {

				
					String mAux = m + "";
					char cmAux[] = mAux.toCharArray();

					String nAux = n + "";

					for (int j = 0; j < cmAux.length; j++) {
						
						char primero = cmAux[0];

						int x;

						for (x = 0; x < cmAux.length - 1; x++)
							cmAux[x] = cmAux[x + 1];

						cmAux[x] = primero;

						mAux = "";

						for (int k = 0; k < cmAux.length; k++) {

							mAux += cmAux[k] + "";

						}

						if (mAux.equals(nAux)) {

							nr++;

						}

					}


					m++;

				}

				n++;

				if (mAuxNum < b)
					m = mAuxNum + 1;

			}

			System.out.println("Case #"+i+": "+nr);

		}

		
		System.out.println("listo");
	}

	public static void main(String[] args) {

		Ejercicio31 ej3 = new Ejercicio31();
		ej3.extraer();
		ej3.encontrar();

	}

}
