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.util.HashSet;
import java.util.Set;


public class RecycledNumbers {
		
	private static int doit(int n, int low) {
		Set<Integer> result = new HashSet<Integer>();
		String val = "" + n;
		int tmpN;
		for (int i = 1; i < val.length(); i++) {
			tmpN = Integer.parseInt(val.substring(i) + val.substring(0, i));
			if (tmpN >= low && tmpN < n && (String.valueOf(tmpN).length() == String.valueOf(n).length())) {
				result.add(tmpN);
			}
		}
		return result.size();
	}
	
	private static int solve(int a, int b) {
		int result = 0;
		for (int i = a; i <= b; i++) {
			result += doit(i, a);
		}
		return result;
	}
	
	public static void main(String[] args) throws Exception {
		String[] in = ProblemUtils.readInput("/home/laf/Downloads/C-small-attempt0.in");
		//String[] in = ProblemUtils.readInput("/home/laf/Desktop/in.txt");
		String[] out = new String[in.length];
		String[] tokens;
		for (int i = 0; i < out.length; i++) {
			tokens = in[i].split(" ");
			out[i] = "" + solve(Integer.parseInt(tokens[0]), Integer.parseInt(tokens[1]));
		}
		ProblemUtils.writeOutput("/home/laf/Desktop/out.txt", out);
	}
	
}
