import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.*;
import java.util.*;

public class recycle
{
	public static int findList(int n, int a)
	{
		String s = Integer.toString(n);
		int count = 0;
		int len = s.length() - 1;
		for(int i = len; i >= 1; i--)
		{
			String st = s.substring(i) + s.substring(0, i);
			if(st.charAt(0) == '0') continue;
			int x = Integer.parseInt(st);
			if(x < n && x >= a)  count++;
		}
		return count;
		
		
	}
	public static void main(String[] args)throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader("recycle.in"));
		PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("recycle.out")));
		
		int n = Integer.parseInt(br.readLine());
		
		for(int i = 0; i < n; i++)
		{
			StringTokenizer st = new StringTokenizer(br.readLine() + " ");
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken());
			int count = 0;
			
			for(int j = a; j <= b; j++)
				count += findList(j, a);
			pw.println("Case #" + (i+1) + ": " + count);
				
		}
		pw.close();
	
	}
}
