import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

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();
	
	}
}
