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.awt.Point;
import java.util.*;

public class Recycle {

    public static void main(String[] args) {
        Recycle r = new Recycle();
        Scanner in = new Scanner(System.in);
        int cases = in.nextInt();
        for (int i = 0; i < cases; i++) {
            System.out.printf("Case #%d: %d\n", i+1, r.solve(in));
        }
    }
    
    private int solve(Scanner in) {
	HashSet<Point> used = new HashSet<Point>();
	int A = in.nextInt();
	int B = in.nextInt();
	int count = 0;
	for (int i = A; i <= B; i++) {
	    String s = Integer.toString(i);
	    for (int k = 1; k < s.length(); k++) {
		String front = s.substring(0, k);
		String sub = s.substring(k);
		String reconstr = sub + front;
		if (reconstr.startsWith("0") || reconstr.equals(s)) continue;
		int reconstructed = Integer.parseInt(reconstr);
		if (reconstructed >= i) continue;
		if (used.contains(new Point(i, reconstructed))) continue;
		if (A <= reconstructed && reconstructed <= B) {
		    used.add(new Point(i, reconstructed));
		    count++;
		}
	    }
	}
	return count;
    }

}