import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}

import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class rec {

	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int c = 1; c <= t; c++)
		{
			System.out.println("Case #" + c + ": " + solve(sc));
		}
	}

	static void debug(Object... objects)
	{
		System.out.println(Arrays.deepToString(objects));
	}
	
	static final int po[]={1,10,100,1000,10000,100000,1000000,10000000};
	
	public static String solve(Scanner sc)
	{
		int A=sc.nextInt();
		int B=sc.nextInt();
		Set<P> s = new HashSet<P>();
		int N = Integer.toString(A).length();
		for(int i=A;i<=B;i++)
		{
			for(int k=1;k<N;k++)
			{
				int m=i%po[k];
				int p=i/po[k];
				int c = m*po[N-k]+p;
				P np=new P(i,c);
				if(i < c && c <= B && !s.contains(np))
				{
					s.add(np);
				}
			}
		}
		return Integer.toString(s.size());
	}
	
	private static class P
	{
		int v;
		int k;
		public P(int v, int k)
		{
			super();
			this.v = v;
			this.k = k;
		}
		@Override
		public boolean equals(Object obj)
		{
			if(obj == this) return true;
			if(!(obj instanceof P)) return false;
			P p = (P)obj;
			return v == p.v && k == p.k;
		}
		@Override
		public int hashCode()
		{
			int res=17;
			res = res*31 + v;
			res = res*31 + k;
			return res;
		}
	}
}