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

public class C{
	static ArrayList< ArrayList<Integer> > mem = new ArrayList< ArrayList<Integer> >();
	static int lenAB = -1;
	static boolean udah[] = new boolean[2000005];
		
	public static void compute(int x){
		int div = 10, gen, mul = 1;
		for (int i = 0 ; i < lenAB-1 ; i ++)mul*=10;
		HashSet<Integer> set = new HashSet<Integer>();
		while(mul > 1){
			gen = x/div + (x%div)*mul;
			if (x%div!=0 && x!=gen && !set.contains(gen)){
				mem.get(x).add(gen);
				set.add(gen);
			}
			div*=10;
			mul/=10;
		}
		udah[x] = true;
	}
	
	public static void main(String args[])throws Exception{
		for (int i = 0 ; i < 2000005 ; i ++){
			mem.add	(new ArrayList<Integer>());
			udah[i] = false;
		}
		
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer tok;
		String input;
		int t, a, b, sum = 0;
		
		t = Integer.parseInt(in.readLine());
		for (int k = 1 ; k <= t ; k ++){
			tok = new StringTokenizer(in.readLine());
			input = tok.nextToken();
			lenAB = input.length();
			a = Integer.parseInt(input);
			b = Integer.parseInt(tok.nextToken());
			sum = 0;
			for (int i = a ; i < b ; i ++){
				if (!udah[i]){
					compute(i);
				}
				int len = mem.get(i).size(), res;
				for (int j = 0 ; j < len ; j ++ ){
					res = mem.get(i).get(j);
					if (i < res && res <= b){
						sum++;
					}
				}
			}
			System.out.println("Case #" + k + ": " + sum);
		}
	}
}