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

public class Main implements Runnable
{
	static Scanner scanner;
	static BufferedReader input;
	static PrintWriter pw;

	public static void main(String[] args) throws Exception
	{
		new Thread(new Main()).start();
	}

	public void run()
	{
		try
		{
			input = new BufferedReader(new FileReader("input.txt"));
			scanner = new Scanner(input);
			pw = new PrintWriter(new File("output.txt"));

			solve();
			pw.close();
		}
		catch(Exception e)
		{
			e.printStackTrace();
			System.exit(1);
		}
	}

	public void solve() throws Exception
	{
		int T = scanner.nextInt();
		for(int t = 0; t < T; t++)
		{

			int A = scanner.nextInt();
			int B = scanner.nextInt();

			String AA = String.valueOf(A);
			String BB = String.valueOf(B);

			int dd = AA.length(); // digit

			int ans = 0 ;
			int n,idx;
			int[] m = new int[dd];
			int[] f = new int[dd];
			for ( n = A ; n < B ; n++ ) {
				for (idx = 1 ; idx < dd ; idx++ ) {
					m[idx] = this.recycle ( n , idx );
					f[idx] = 0 ; 
					if ( String.valueOf(m[idx]).length() == dd ) {
						if ( m[idx] > n && m[idx] <= B ) {
							f[idx]=1;
							ans++;
						}
					}
				}

				for ( int i=0 ; i < dd ; i++ ){
					if ( f[i] == 1 ) {
						for ( int j = i+1 ; j < dd ; j++) {
							if ( m[i] == m[j] ) {
								ans--;
							}
						}
					}
				}
			}

			pw.println("Case #" + (t+1) + ": " + ans);
		}
	}
	public int recycle (int i, int index){
		return Integer.parseInt ( this.recycle ( String.valueOf(i),index ) ) ;
		
	}

	public String recycle (String s, int index){
		return s.substring(index, s.length()) + s.substring( 0, index );
	}
}
