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.Scanner;

/*
 * Google Code Jam 2012
 * Program by Tommy Ludwig
 * Problem: Recycled Numbers (large dataset)
 * Date: 2012-04-14
 * Time: 18:30 (PM) EST
 */


public class recycle_big {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int A, B, n, m, y = 0;
			A = in.nextInt();
			B = in.nextInt();
			
			for (m = B; m > A; m--) {
				boolean skip = true;
				int lastN = 0;
				String strM = String.valueOf(m);
				
				for (int x = 1; x < strM.length(); x++) {
					if (Integer.valueOf(strM.substring(x, x+1)) != 0 && Integer.valueOf(strM.substring(x, x+1)) <= Integer.valueOf(strM.substring(0, 1))) {
						skip = false;
						break;
					}
				}
				if (skip) continue;
				
				//mutate m to make a valid n
				for (int l = 1; l < strM.length(); l++) {
					String sub = strM.substring(l);
					
					String strN = sub + strM.substring(0, l);
					n = Integer.valueOf(strN);
					
					//check that n is within bounds
					//check for duplicate pairs
					//check for leading zeros in strN
					if (n >= A && n < m && n != lastN && strN.equalsIgnoreCase(String.valueOf(n))) {
						y++;
						lastN = n;
					}
				}
			}
			System.out.printf("Case #%d: %d\n", i, y);
		}
	}
}