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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;


public class Recycled_Numbers_2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		String strFileName = "C-small-attempt0";
		String strInputFileName = strFileName + ".in";
		String strOutputFileName = strFileName + ".out";

		int iCaseNumber=1;
		
		try {
			////////////////////////////////////////////////////////////////
			BufferedReader in = new BufferedReader(new FileReader(strInputFileName));
			BufferedWriter out = new BufferedWriter(new FileWriter(strOutputFileName));
			String inString = "";
			String outString = "";

			String sTotalNumber = in.readLine();
			
			while ((inString = in.readLine()) != null) {
				System.out.println(inString);
				// µÎ °³ÀÇ ¼ýÀÚ·Î ÀÌ·ç¾îÁ® ÀÖ´Ù.
				String[] saRange = inString.split(" ");
				int iStart = Integer.parseInt(saRange[0]);
				int iEnd = Integer.parseInt(saRange[1]);
				System.out.println(String.format("S:[%d], E:[%d]", iStart, iEnd));
				
				ArrayList<Integer> listCompare = new ArrayList<>();
				int iCount = 0;
				
				for (int iNumber = iStart; iNumber <= iEnd; iNumber++) {
					
					// ¼öÀÇ ÀÚ¸´¼ö ¾ò±â
					int iGetDigit = iNumber;
					int iDigitCount = 0;
					while (iGetDigit > 0) {							
						iGetDigit /= 10;
						iDigitCount++;
					}
					
					//System.out.println(String.format("%d's Digit is %d",iNumber, iDigitCount));
					
					boolean bFound = false;
					
					// ºñ±³
					for (int idx = 0; idx < listCompare.size(); idx++) {
						int iCompareNumber = listCompare.get(idx);
												
						for (int iDigit = 1; iDigit <= iDigitCount-1; iDigit++) {
							int iFront = (int) (iNumber/(Math.pow(10, iDigit)));
							int iBack = (int) (iNumber%(Math.pow(10, iDigit)));
							int iModify = (int) (iBack * (Math.pow(10, iDigitCount-iDigit)) + iFront);
							
//							System.out.println(String.format("Check: iNumber:[%d], iDigit:[%d], iFront:[%d], iBack:[%d], iModify:[%d]"
//																		, iNumber, iDigit, iFront, iBack, iModify));
							
							if (iCompareNumber == iModify) {
								//System.out.println(String.format("Compare:[%d], iNumber:[%d], iModify[%d], iDigit[%d]", iCompareNumber, iNumber, iModify, iDigit));
								iCount ++;
								//listCompare.remove(idx);
								bFound = true;
								//break;
							}
							
						}
						
//						if (bFound) {
//							break;
//						}						
					}
					listCompare.add(iNumber);
					
				}
				
				System.out.println(String.format("Count:[%d]",iCount));
				
				outString = String.format("Case #%d: %d\n", iCaseNumber++, iCount); 
				System.out.print(outString);
				out.write(outString);
			}
			in.close();
			out.close();
			////////////////////////////////////////////////////////////////
		} catch (IOException e) {
			System.err.println("ERROR");
			System.err.println(e); // ¿¡·¯°¡ ÀÖ´Ù¸é ¸Þ½ÃÁö Ãâ·Â
			System.exit(1);
		}	     
	}

}
