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.*;

public class recycled_numbers {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		
		int T = scanner.nextInt();
		int[] answers = new int[T];
		
		for (int c = 0; c < T; c++) {
			int A = scanner.nextInt();
			int B = scanner.nextInt();
			
			int numdigits;
			for (numdigits = 1; A-Math.pow(10,numdigits) >= 0; numdigits++);			
			
			HashSet<Integer> done = new HashSet<Integer>();
			
			int n = A;
			int possiblem;
			answers[c] = 0;
			while (n <= B) {
				possiblem = n;
				int possiblemsthisround = 0;
				for (int i = 0; i <= numdigits; i++) {
					if ((possiblem%10) != 0) {
						possiblem = (possiblem%10)*((int)Math.pow(10,numdigits-1)) + (possiblem-(possiblem%10))/10;
						if ((possiblem <= B) && (possiblem > n)) {
							if (done.contains(possiblem) == false) {
								done.add(possiblem);
								possiblemsthisround++;
							}
							done.add(possiblem);
						}
					}
					else possiblem = (possiblem%10)*((int)Math.pow(10,numdigits-1)) + (possiblem-(possiblem%10))/10;
				}
				if (possiblemsthisround > 0) answers[c] += possiblemsthisround*(possiblemsthisround + 1)/2;
				n++;
			}
		}
		for (int i = 0; i < T; i++) {
			int j = i+1; 
			System.out.println("Case #"+j+": "+answers[i]);
		}
	
	}
}
