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;
	}
}
package qualif3;

import java.io.File;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Qualif3 {
	
	public static void main(String[] args) throws Exception {
		
		Scanner scan = new Scanner(new File("input"));
		
		int num = Integer.parseInt(scan.nextLine());
		
		for (int i = 1; i <= num; i++) {
			int a = scan.nextInt();
			int b = scan.nextInt();
			System.out.println("Case #" + i + ": " + solve(a, b));
		}
		
	}

	private static int solve(int a, int b) {
		if (b < 21) return 0;
		if (a < 12) a = 12;
		
		Set<String> founds = new HashSet<String>();
		
		for (int num = a; num <= b; num++) {
			int tens = 10;
			int digits = ((int) Math.log10(num));
			int inv = (int) Math.pow(10, digits);
			
			while (num / tens > 0) {
				int q = num / tens;
				int r = num % tens;
				
				int test = r * inv + q;
				if (test > num && test <= b) {
					founds.add("" + num + "|" + test);
				}
				
				inv /= 10;
				tens *= 10;
			}
		}
		
		return founds.size();
	}
	
}

