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.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;


public class RecycleNumbers {
	
	private static final Map<Integer,Integer> power = new HashMap<Integer,Integer>();
	
	static{
		power.put(0,1);
		power.put(1,10);
		power.put(2,100);
		power.put(3,1000);
		power.put(4,10000);
		power.put(5,100000);
		power.put(6,1000000);
	}
	
	private static int recycle(int b , int max)
	{
		int size =0 ,ret = 0;
		int a = b , rem = 0 , i = 0;
		while((size++ > -1) && ((a = a/10)!= 0));
		a = b;
		int myPower = power.get(size -1);
		Set<Integer> mySet = new HashSet<Integer>();
		for(i = 0 ; i < size-1; i++)
		{
			rem = a%10;
			a = rem * myPower + a/10;
			if(a > b && a <= max && !mySet.contains(a)) ret++;
			mySet.add(a);
		}
		return ret;
	}
	
	public static void main(String[] args) throws IOException {
		if (args.length < 2) {
			System.err.println("Please enter the Valid I/O Paths in the argument ");
			System.err.println("First Input , then OutPut ");
			System.exit(0);
		}
		File inFile = new File(args[0]);
		File outFile = new File(args[1]);
		BufferedReader in = new BufferedReader(new InputStreamReader(
				new FileInputStream(inFile)));
		PrintWriter out = new PrintWriter(new FileOutputStream(outFile));
		String myLine = in.readLine();
		int t = Integer.parseInt(myLine);
		int caseNum = 1 , result;
		int a , b;
		while (t-- > 0) {
			myLine = in.readLine();
			String[] myStr = myLine.split(" ");
			a = Integer.parseInt(myStr[0]);
			b = Integer.parseInt(myStr[1]);
			result = 0;
		    for(int i = a ; i < b ; i++)
		    	result += recycle(i,b);
			out.println("Case #" + (caseNum) + ": " + result);
			caseNum++;
		}
		out.close();
	}
}
