import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;


public class Solution {
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
	    int T = scan.nextInt();
	    int[] counts = new int[T];
	    int max =2000001;
	    boolean[] used = new boolean[max];
	    for(int i=0;i<T;i++){
	    	int A = scan.nextInt();
	    	int B = scan.nextInt();
	    	counts[i]=count(A,B,used);	    	
	    }	
	    
	    for(int i=0;i<T;i++){
			System.out.println("Case #"+(i+1)+": "+counts[i]);
		}
	}
	
	public static int count(int A,int B,boolean[] used){
		int result=0;
		
		int num=0;
		int temp=A;
		
		int total=1;
		
		while(temp>0){
			temp=temp/10;
			num++;
			total*=10;
		}
		
		
		HashSet<Integer> set = new HashSet<Integer>();
		int rotato=0;
		int size =0;
		for(int i=A;i<=B;i++){
			if(!used[i]){
				set.clear();
				set.add(i);
				temp=i;
				int exp =1;
				
				for(int j=1;j<num;j++){
					exp*=10;
					rotato = (i%exp)*(total/exp)+i/exp;
				
					if(rotato>=A && rotato<=B){
						set.add(rotato);
						used[rotato]=true;
					}					
				}
				//System.out.println(size);
				size = set.size();
				if(size>1){
					result+=size*(size-1)/2;
				}				
			}
		}
		Arrays.fill(used, A,B,false);
		
		return result;
		
	}	
	
}
