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.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;

public class C {
	private static Map<Long, Long> map = new HashMap<Long, Long>();

	public static void main(String args[]) {
		try {
			String fileName = "C:\\Users\\Lenovo Z370\\Desktop\\gcj\\comp-2012\\C-small-attempt1.in";
			BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));
			int t = Integer.parseInt(br.readLine());
			for(int i=0; i<t; i++) {
				map.clear();
				String[] abs = br.readLine().split("\\s+");
				long a = Long.parseLong(abs[0]);
				long b = Long.parseLong(abs[1]);
				
				long count = 0;
				
				for(long j=a; j<=b; j++) {
					long n=j;
					String s = String.valueOf(n);
					int l = s.length()-1;
					for(int k=0; k<l; k++) {
						int r = (int)(n%10);
						long m = (long)(r*Math.pow(10, l)) + n/10;

						if(m > j && m >= a && m <= b) {
							Long val = map.get(j);
							if(val == null || val != m) {
								map.put(j, m);
								count++;
							}
						}
						n=m;
					}
				}
				
				System.out.println("Case #" + (i+1) + ": " + count);
			}
		} catch(Exception e) {
			e.printStackTrace();
		}
	}
}
