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 files;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Hashtable;

public class Recycle2 {
	public static void main(String[] args)
	{
		try
		{
			String line;
			String data="";
			 File ff = new File("Output.txt");
		     if (ff.exists())
		     {
		    	 ff.delete();
			 }
		     //BufferedReader br = new BufferedReader(new FileReader("/Users/Sush/Documents/workspace1/CJ/src/files/Input.txt"));
		     BufferedReader br = new BufferedReader(new FileReader("/Users/Sush/Downloads/C-small-attempt2.in.txt"));
			 
			 StringBuffer sb = new StringBuffer();
				 while((line = br.readLine())!= null)
				 {
					 sb = sb.append(line +"\n");
				 }
			 String[] nos = sb.toString().split("\n");
			 for (int i = 1; i< nos.length; i++)
			 {
		     Hashtable<Integer, Integer> counts = new Hashtable<Integer, Integer>();
		     //System.out.println("Str "+nos[i]);
			 String[] num = nos[i].split(" ");
			 int count=0;
		     int begin=Integer.parseInt(num[0]);
		     int end = Integer.parseInt(num[1]);
		     while(begin < end)
		     {
		    	 int a = begin;
		    	 int d = (int)Math.floor(Math.log10(a));
		    	 
		    	 if (d!= 0)
		    	 {
		    	 int f = a/(int)(Math.pow(10, d));
		    	 int n = a/(int)(Math.pow(10, d-1));
		    	 if (f>n)
		    	 {
		    		 a = f * (int)Math.pow(10, d) + n * (int)Math.pow(10, d-1); 
		    	 }
		    	 }
		    	 int check = a;
		    	 int x = 0; 
		     if (!counts.containsKey(a))
		     {
		    	 counts.put(a, 0);
			     while(x != a)
			     {
			    	 x = (check%10)*(int)(Math.pow(10.0, d)) + (check/10);
			    	 check = x;
			    	 if (x > a && x <= end)
			    	 {
			    		 //counts.put(x, 0);
			    		 count = count +1; 
			    		 counts.put(a, count);
			    	 }
			     }
		     }
		     begin = begin + 1;
		     }
		     data = data + "Case #"+i+": "+count+"\n";
		     System.out.print("Case #"+i+": ");
		     System.out.println(count);
		     
		}

	     BufferedWriter bw = new BufferedWriter(new FileWriter(ff, true));
	     bw.write(data);
	     bw.close();
		}
		catch(Exception e)
		{
			System.out.println(e);
		}
	}
}
