import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;


public class TaskC {

	static int numberLength;
	
	public static void main(String[] args ) throws FileNotFoundException {
		File fileName = new File("taskc.txt");
		Scanner inFile = new Scanner(fileName);
		int n = inFile.nextInt();
		inFile.useDelimiter("\\r?\\n");
		String[] cases = new String[n];
		for (int i = 0; i < n; i++)
			cases[i] = inFile.next();
		List<String> result = new ArrayList<String>();
		for (String caseString: cases) {
			int recycledNumbers = 0;
			Scanner caseScanner = new Scanner(caseString);
			String lowerBoundString = caseScanner.next();
			int lowerBound = Integer.parseInt(lowerBoundString);
			int upperBound = caseScanner.nextInt();
			for (int i = lowerBound; i <= upperBound; i++) {
				String iString = new Integer(i).toString();
				for (int j = i + 1; j <= upperBound; j++) {
					String jString = new Integer(j).toString();
					if (evaluate(iString, jString))
						recycledNumbers++;
				}
			}
			result.add("" + recycledNumbers);
		}
		
		for (int i = 0; i < result.size(); i++) {
			System.out.println("Case #" + (i+1) + ": " + result.get(i));
		}
	}

	private static boolean evaluate(String iString, String jString) {
		for (int n = 1; n < jString.length(); n++) {
			String testString = jString.substring(n) + jString.substring(0, n);
			if (iString.equals(testString))
				return true;
		}
		return false;
	}
	
}
