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));
			
		}
		
		
		

	}
	
	
}
package qualification;

public class Pair implements Comparable{
	int n;

	int m;

	public Pair(int n, int m){
		this.n = n;
		this.m = m;
	}

	@Override
	public boolean equals(Object obj){
		if(n == 1212)
			System.out.println("1");

		if(obj == null)return false;

		Pair other = (Pair)obj;
		if(n == other.n && m == other.m){
			return true;
		}
		return false;
	}

	public int hashCode() {
		int hash = 1;
	    hash = hash * 31 + new Integer(n).hashCode();
	    hash = hash * 31 + new Integer(m).hashCode();
		return  hash;
	}

	@Override
	public String toString(){
		return "(" + n + ", " + m + ")";
	}

	@Override
	public int compareTo(Object other){
		Pair p = (Pair)other;
		if(this.n == p.n)
			return new Integer(m).compareTo(new Integer(p.m));
		else
			return new Integer(n).compareTo(new Integer(p.m));
	}
}
