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.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	private static boolean [] used;
	public static int cnt(int a)
	{
		int res = 0;
		while(a != 0)
		{
			a/=10;
			res++;
		}
		return res;
	}
	
	public static int tenMult(int n)
	{
		int res = 1;
		for(int i = 0; i < n -1; i++)
			res *= 10;
		return res;
	}
 
	public static int solve(int n, int limit)
	{
		int res = 0;
		int c = cnt(n);
		int tmp = n;
		used = new boolean[2000000];
		for(int i = 0; i < c-1; i++)
		{
			int rem = tmp%10;
			tmp /= 10;
			
			tmp += tenMult(c) * rem;
			if(tmp <= 2000000 && tmp > n && tmp <= limit && used[tmp] == false)
				{
				used[tmp] = true;
				//System.out.println("for " + n + " = " + tmp);
				res++;}
		}
		return res;
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		System.setIn(new FileInputStream("input"));
		
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		//used = new boolean[2000000];
		for(int j = 1; j <= n; j++)
		{
			
			int A = s.nextInt();
			int B = s.nextInt();
			int res = 0;
			for(int i = A; i <= B; i++)
			{
				res += solve(i,B);
			}
			System.out.println("Case #" + j + ": " + res);
		}
	}

}
