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));
	}
}

package com.gao.t3;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashSet;

public class Main {
	public static void main(String args[]){
		try{
			FileInputStream fin=new FileInputStream("C:\\Users\\Gao\\Downloads\\C-small-attempt0.in");
			//FileInputStream fin=new FileInputStream("cc.txt");
			BufferedReader br=new BufferedReader(new InputStreamReader(fin));
			FileOutputStream fout=new FileOutputStream("out.txt");
			BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(fout));
			int n=Integer.parseInt(br.readLine());
			HashSet<String> hash=new HashSet<String>();
			for(int i=0;i<n;i++){
				int A,B;
				hash.clear();
				String s[]=br.readLine().split(" ");
				A=Integer.parseInt(s[0]);
				B=Integer.parseInt(s[1]);
				int j=A;
				for(;j<=B;j++){
					String strA=j+"";
					int m=strA.length();
					for(int k=0;k<m-1;k++){
						String end=strA.substring(m-1-k,m);
						if(end.startsWith("0")) continue;
						String start=strA.substring(0,m-1-k);
						String strB=end+start;
						if(strA.compareTo(strB)<0&&strA.compareTo(A+"")>=0&&strB.compareTo(B+"")<=0){
							hash.add(strA+" "+strB);
						}
					}
				}
				String str="Case #"+(i+1)+": "+hash.size();
				bw.write(str);
				if(i<n-1){bw.newLine();}
			}			
			br.close();
			bw.close();
			fin.close();
			fout.close();
		} catch(IOException e){
			e.printStackTrace();
		}
	}

}
