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.util.ArrayList;
import java.util.LinkedList;



public class RecycledNumbers {
	public static void solve(String fname) {
		Read r = new Read();
		r.Read(fname);
int numOfTestCases=r.noOfTestCases;
int[] numbers =  r.nums;
String finalAnser="";
for(int i=0;i<numOfTestCases;i++){
	String answer="";
	int firstNum = numbers[2*i];
	int secondNum = numbers[2*i+1];
	int mid = ((secondNum-firstNum)/2)+1;
	int noOfans=0;
	for (int j = firstNum; j < secondNum; j++) {
		String numb = j+"";
//		/LinkedList<Integer> number = new LinkedList<Integer>();	
for (int k = 0; k < numb.length(); k++) {
	String first =  numb.substring(0,k);
	String last =  numb.substring(k,numb.length());
String newNumb = last+first;
int numbC = Integer.parseInt(newNumb);
if((numbC<=secondNum)&&(numbC>j)){
	noOfans++;
}

}

	
		int x=0;
//		int k=0;
//		while(!number.isEmpty()){
//			x=(int) (x+number.removeLast()*Math.pow(10, k));
//			k++;
//		}
		
		
	}
	answer = "Case #"+(i+1)+": "+noOfans;
	finalAnser = finalAnser+answer+"\n";
	
}
r.write("out", finalAnser);
System.out.println(finalAnser);	
	}
	public static void main(String[] args) {
		
	solve("test");
	}
}
