import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.SortedSet;
import java.util.TreeSet;


public final class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		BufferedReader br = null;
		try {
			br = new BufferedReader(new InputStreamReader(new FileInputStream("test.txt")));
			int count = 1;
			String input;
			int cases = Integer.valueOf(br.readLine());
			while (((input = br.readLine()) != null) && (count <= cases)) {
				String output = "Case #"+(count++)+": "+process(input);
				System.out.println(output);				
			}
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		} finally {
			if (br!=null) try { br.close(); } catch(IOException e) {}
		}
	}
	private static final int process(String input) {
		String[] s = input.split(" ");
		if (s[0].length()==1) return 0;
		int A = Integer.valueOf(s[0]);
		int B = Integer.valueOf(s[1]);
		int counter = 0;
		for (int n=A; n<B; n++) {
			SortedSet<Integer> rotates = rotate(n, A, B);
			if (n != rotates.first()) continue;
			counter += count(rotates.size());
		}
		return counter;
	}
	
	private final static int count(int n) {
		if (n < 2) return 0;
		if (n == 2) return 1;
		return --n + count(n);
	}
	
	private static final SortedSet<Integer> rotate(int N, int min, int max) {
		SortedSet<Integer> set = new TreeSet<Integer>();
		set.add(N);
		String sN = Integer.toString(N);
		for (int i = 0; i < sN.length()-1;i++) {
			//if (sN.charAt(1) == '0') continue;
			sN = sN.substring(1)+sN.charAt(0);
			int n = Integer.valueOf(sN);
			if (min<=n && n<=max) set.add(n);
		}
		return set;
	}
}
