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.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Set;
import java.util.TreeSet;

public class RecycledNumbers {

	public static void main(String[] args) throws IOException {
		System.setErr(new PrintStream("qualification/C-small-attempt1.out"));
		FileReader reader = new FileReader("qualification/C-small-attempt1.in");
		BufferedReader br = new BufferedReader(reader);
		int tc = Integer.parseInt(br.readLine());
		for (int t = 0; t < tc; t++) {
			String[] nums = br.readLine().split("\\s");
			String a = nums[0];
			String b = nums[1];
			int min = Integer.parseInt(a);
			int max = Integer.parseInt(b);
			int answer = 0;
			for (int i = min; i < max; i++) {
				String n = String.valueOf(i);
				Set<String> set = new TreeSet<String>();
				for (int j = 0; j < n.length(); j++) {
					set.add(n.substring(j) + n.substring(0, j));
				}
				for (String s : set) {
					if (n.compareTo(s) < 0 && b.compareTo(s) >= 0) {
						answer++;
					}
				}
			}
			System.out.printf("Case #%d: %d\n", t + 1, answer);
			System.err.printf("Case #%d: %d\n", t + 1, answer);
		}
	}

}
