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

class gcj2{
	public static void main(String[] args) throws IOException{
		BufferedReader inp = new BufferedReader(new FileReader("inp.txt"));
		BufferedWriter out = new BufferedWriter(new FileWriter("out.txt"));
		int test = Integer.parseInt(inp.readLine());
		int p = 1;
		while(test>0){
			String d[] = inp.readLine().split(" ");
			int a = Integer.parseInt(d[0]);
			int b = Integer.parseInt(d[1]);
			int i = a;
			int count = 0;
			while(i<=b){
				String s = new Integer(i).toString();
				int j = 1;
				HashSet<Integer> se = new HashSet<Integer>();
				while(j<s.length()){
					String temp = s.substring(j,s.length())+s.substring(0,j);
					if(temp.charAt(0)=='0') {
						j++;
						continue;
					}
					else {
						int t = Integer.parseInt(temp);
						se.add(t);
					}
					j++;
				}
				Iterator<Integer> it = se.iterator();
				while(it.hasNext()){
					int gg = it.next();
					if(gg>i&&gg<=b){
				//		System.out.println(gg +" "+i);
						count++;
					}
				}
			//	System.out.println("------------------");
				i++;
			}
			out.write("Case #"+p+": "+count+"\n");
			System.out.println(count);
			test--;
			p++;
		}
		out.close();
	}
}