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 qualifier;

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;


public class C {
	static boolean done[] = new boolean[2222222];

	public static void main(String args[]) throws IOException {
		Scanner in = new Scanner(new File("C-small.in"));
		System.setOut(new PrintStream(new File("C-small.out")));
		int tc = in.nextInt();
		
		for(int c=1; c<=tc; c++) {
			int a = in.nextInt();
			int b = in.nextInt();
			int d = 0;
			int t = a;
			int m = 1;
			int ct  = 0;
			int n;
			while(t > 0) {
				t /= 10;
				d++;
				m *= 10;
			}
			d--;
			m /= 10;
			
			Arrays.fill(done, false);
			
			for(int i=a; i<=b; i++) {
				if (done[i])
					continue;
				done[i] = true;
				n = i;
				t = 0;
				for(int j=d; j>0; j--) {
					n = (n/10)+((n%10)*m);
					if(n > m && n >= a && n <= b && !done[n]) {
						t++;
						done[n] = true;
					}
				}
				ct += (t*(t+1))/2;
			}
			System.out.printf("Case #%d: %d\n", c, ct);
		}
	}
}
