package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

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);
		}	     
	}

}
