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.HashSet;
import java.util.Scanner;


public class RN {
	
	static int A,B;
	static int[] chuso = new int[11];
	static int result = 0;
	// 2121
	public static void RN(int n, int B)
	{
		HashSet<Integer> hs = new HashSet<Integer>();
		String ns = Integer.toString(n);
		int nl = ns.length();
		for (int i = 1; i < nl; i++)
		{
			String tmp = ns.substring(i);
			String tmp1 = ns.substring(0, i);
			String new_num = tmp + tmp1;
			int m = Integer.parseInt(new_num);
			if (m > n && m <= B)
				{
					//System.out.println(m + " " + n);
					hs.add(m);
					//result ++;
				}
		}
		result += hs.size();
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int k = 0; k<T; k++)
		{
		A = sc.nextInt();
		B = sc.nextInt();
		result = 0;
		for (int i = A; i<=B; i++)
			RN(i,B);
		//RN(12);
		System.out.println("Case #" + (k+1) + ": " + result);
	
		}
	}

}
