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.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class Q3RecycledNumbers {

	public static void main(String[] args) throws FileNotFoundException, IOException {
		Scanner scanner = new Scanner(new File("q3.input"));
		
		FileWriter writer = new FileWriter("q3.output");
		
		int cases = scanner.nextInt();
		
		for (int i = 1; i <= cases; i++) {
			
			int a = scanner.nextInt();
			int b = scanner.nextInt();
			
			int n = solve(a, b);
			
			writer.write("Case #" + i + ": " + n + "\n");
		}
		
		writer.close();
	}

	private static int solve(int a, int b) {
		int n = 0;
		
		for (int i = b; i >= a; i--) {
			String strI = String.valueOf(i);
			Set<Integer> mirrorSet = new HashSet<Integer>();
			
			for (int j = 1; j <= strI.length(); j++) {
				String r = strI.substring(j, strI.length()) + strI.substring(0, j);
				int intR = Integer.valueOf(r);
				if (intR < i && intR >= a && !mirrorSet.contains(intR)) {
					mirrorSet.add(intR);
					n++;
				}
			}
		}
		
		return n;
	}
	
}
