import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

import java.util.Scanner;
import java.io.*;
import java.util.HashSet;
import java.util.LinkedList;


public final class problem2 {

	public static HashSet <String> hash;
	
	public static String decode(int min, int max){
		int total = 0;
		hash = new HashSet <String>();
		
		try{
			//FileWriter fw = new FileWriter("final1.txt");
			
			for(int i = min ; i <= max ; i++){
				String n = Integer.toString(i);
				int len = n.length();
				n = n.concat(n);
				
				int count = 0;
				for(int j = 0 ; j <= len ; j++){
					String tmp = n.substring(j, j+len);
					
					if(tmp.charAt(0) != '0'){
						int m = Integer.valueOf(tmp);
						
						if(m >= min && m <= max){
							if(!hash.contains(tmp)){
								hash.add(tmp);
								count++;
								//fw.write(tmp + "\n");
							}
						}
					}
				
				}
				
				if(count > 1)
					count = count * (count - 1) / 2;
				else
					count = 0;
				
				total += count;
			
			}
			//fw.write(total);
			//fw.close();
			
			
		}catch(Exception e){}
		
		return Integer.toString(total);
		
	}


	
	public static void main(String[] args){

		try{
			//Scanner sc = new Scanner(new File("yo.txt"));
			Scanner sc = new Scanner(new File("C-large.in"));
			FileWriter fw = new FileWriter("Large.txt");
		
		
			String tmp = sc.nextLine();
			int step = Integer.valueOf(tmp);
		
			int counter = 1;
			while(sc.hasNextLine()){
				//System.out.print("Case #" + counter + ": "); 
				
				String s = sc.nextLine();
				Scanner ssc = new Scanner(s);
				int A = ssc.nextInt();
				int B = ssc.nextInt();
				
				
				//System.out.println(A + " " + B); 
				String xx = decode(A, B);
				System.out.println("Case #" + counter + ": " + xx);
				fw.write("Case #" + counter + ": " + xx);
				fw.write("\n");
				counter++;
				if(step < counter)
					break;
			}
			fw.close();
		}catch(Exception e){}
		
	}
	
}