
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class RecycleNumber {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(".in")));
		int num =0;
		String line = null;
		line = br.readLine();
		int i=0;
		num = Integer.parseInt(line);
		
		while(num-->0){
			int result = 0;
			line = br.readLine();
			i++;
			String[] nums = line.split(" ");
			int min = Integer.parseInt(nums[0]);
			int max = Integer.parseInt(nums[1]);
			
			for(int t=min;t<=max;t++){
				result += countRecyles(t,min,max);
			}
			
			System.out.println("Case #"+i+": "+result/2);
			
		}
		br.close();
	}
	
	public static int countRecyles(int num,int min,int max){
		int count = 0;
		Set<Integer> result = getNums(num);
		for(int i:result){
			if(i>=min&&i<=max){
				count++;
			//	System.out.println(num+","+i);
			}
			
		}
		
		return count;
	}
	
	public static Set<Integer> getNums(int num){
		Set<Integer> list = new HashSet<Integer>();
		
		StringBuilder sb = new StringBuilder(num+"");
		for(int i=0;i<sb.length();i++){
			char last = sb.charAt(sb.length()-1);
			sb.deleteCharAt(sb.length()-1);
			sb.insert(0, last);
			if(last!='0'){
				int tmp = Integer.parseInt(sb.toString());
				if(tmp != num)
					list.add(tmp);
			}
		}
		
		return list;
	}
	

}
