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.FileReader;
import java.io.IOException;


public class Recycled {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int tests;
		try{
			BufferedReader stdin = new BufferedReader(new FileReader(args[0]));
			tests = Integer.parseInt(stdin.readLine());
			for(int i = 0; i < tests; i++){
				System.out.print("Case #"+(i+1) + ": ");
				solve(stdin.readLine());
				System.out.println();
			} 
		}catch(IOException e){
			e.printStackTrace();
		}
		System.exit(0);

	}
	
	private static void solve(String s){
		String [] nums = s.split(" ");
		int a = Integer.parseInt(nums[0]);
		int b = Integer.parseInt(nums[1]);
		int total = 0;
		for(int m = a+1; m <= b; m++){
			for(int n = a; n < m; n++){
				total += canRecycle(n,m);
			}
		}
		System.out.print(total);
	}
	
	private static int canRecycle(int n, int m){
		int total = 0;
		String s = "" + n;
		int len = s.length();
		int[] digits = new int[len];
		boolean descending = true;
		for(int i = 0; i < len-1; i++)
			descending &= (digits[i]>digits[i+1]);
		if(!descending){
			String num = "" + n;
			String match = "" + m;
			num = num.substring(len-1).concat(num.substring(0, len-1));
			while(!num.equals(s)){
				if(num.equals(match))
					total += 1;
				num = num.substring(len-1).concat(num.substring(0, len-1));
			}
			
		}
		//System.out.println(total);
		return total;
	}
}
