import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.*;
import java.util.*;
public class C{
	public static void main(String[] args){
	  try{
		String inputFile = "C-small-attempt0.in";
		String outputFile = "C-small-attempt0.out";
		Scanner sc = new Scanner(new File(inputFile));
        FileWriter fwStream = new FileWriter( outputFile );
        BufferedWriter bwStream = new BufferedWriter( fwStream );
        PrintWriter pwStream = new PrintWriter( bwStream );
		int numCase = sc.nextInt();
		for(int i = 0; i < numCase; i++){
			int answer = 0;
			int min = sc.nextInt();
			int max = sc.nextInt();
			for(int j = min; j <= max; j++){
				System.out.println("inside j loop");
				String a = String.valueOf(j);
				int length = a.length();
				int temp = ((j % 10) * (int)(Math.pow(10,length-1))) + (j /10);
				while(temp != j){
					System.out.println("inside while temp loop");
					System.out.println("temp = " + temp);
					System.out.println("j = " + j);
					if(temp >= min && temp <= max && temp > j){
						answer++;
					}
					temp = ((temp % 10) * (int)(Math.pow(10,length-1))) + (temp /10);
				}
			}
			pwStream.print("Case #"+(i+1)+ ": ");
			pwStream.print(answer);
			pwStream.println();
		}
		pwStream.close();
		sc.close();
		}
	  catch(Exception e){e.printStackTrace();}
	}
}