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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Enumeration;
import java.util.HashSet;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.Set;
import java.util.StringTokenizer;


public class C {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
		PrintWriter out =new PrintWriter(new FileWriter("C-large.out"));
		int T = Integer.parseInt(br.readLine());		
		
		
		
		for(int i = 0; i <T;i++)
		{
			
			String input = br.readLine();
		
			StringTokenizer st = new StringTokenizer(input);
			int n = new Integer(st.nextToken());
			int m = new Integer(st.nextToken());
			int count =0;
			for(int j=n;j<=m;j++)
			{
				Set s = new HashSet();
				int k = j;
				int b=10;
				while(k/b>0)
				{
					int first = k/b;
					int second = k%b;
					String res = Integer.toString(second)+Integer.toString(first);
					int ires = Integer.parseInt(res);
					if(ires != j&& ires>j && ires <=m )	
					{
						count++;
						
					}
					if(ires==j)
						break;
					b=b*10;
				}
							
			} 
						
			out.println("Case #"+(i+1)+": " +count);
		}
			
		br.close();
		out.close();
		}
	}

