import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.*;
import java.util.*;

public class dancing
{
	public static void main(String[] args)throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader("dancing.in"));
		PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("dancing.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 k = a; k <= b; k++)
			{
				if(k == 1000) continue;
				if(k / 10 == 0) continue;
				if(k / 100 == 0)
				{
					String s = "" + (k % 10) + "" + (k / 10);
					int si = Integer.parseInt(s);
					if(si < k && si >= a) count++;
					continue;
				}
				if(k / 1000 == 0)
				{
					String s1 = "" + (k%100) + "" + (k/100);
					int i1 = Integer.parseInt(s1);
					if(i1 >= a && i1 < k) count++;
					
					String s2 = "" + (k%10) + "" + (k/10);
					int i2 = Integer.parseInt(s2);
					if(i2 < k && i2 >= a) count++;
				}
				
			}
			pw.println("Case #" + (i+1) + ": " + count);
		}
		pw.close();
		System.exit(0);
		
	}
}
