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.HashSet;

public class ProblemC
{
	public static void main(String[] args) throws Exception
	{
		String base = "C-large";
		BufferedReader reader = new BufferedReader(new FileReader(base+".in"));
		BufferedWriter writer = new BufferedWriter(new FileWriter(base+".out"));
		int place = 0;
		reader.readLine();
		while (reader.ready())
		{
			String line = reader.readLine();
			String[] strs = line.split(" ");
			int a = Integer.parseInt(strs[0]);
			int b = Integer.parseInt(strs[1]);
			int num = solve(a,b);
			writer.write("Case #" + (++place) + ": " + num+'\n');
		}
		reader.close();
		writer.close();
	}

	public static int solve(int a, int b)
	{
		int number = 0;
		for (int i=a;i<=b;i++)
		{
			HashSet<Integer> set = new HashSet<Integer>();
			String str = i+"";
			for (int p=str.length()-1;p>=1;p--)
			{
				String test = str.substring(p) + str.substring(0,p);
				int j = Integer.parseInt(test);
				String test2 = j+"";
				if (i < j && j <= b && str.length()==test2.length() && !set.contains(j))
				{
					set.add(j);
					number++;
				}
			}
		}
		return number;
	}
}
