package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;

public class  Main
{
	private static int recycled(int n, int m)
	{
		String sN = (new Integer(n)).toString();
		String sM = (new Integer(m)).toString();
		int nL = sN.length();
		int mL = sM.length();
		
		HashMap<Integer, HashSet<Integer>> pairs = new HashMap<Integer, HashSet<Integer>>();
		
		for(int i = 0; i < nL; i++)
		{
			String swap = sN.substring(nL-1-i);
			String test = swap + sN.substring(0, nL-1-i);
			int testS = Integer.parseInt(test);
			if(testS == m)
			{
				if(!pairs.containsKey(testS))
				{
					HashSet<Integer> newSet = new HashSet<Integer>();
					newSet.add(m);
					pairs.put(testS, newSet);
				}
				else
				{
					pairs.get(testS).add(m);
				}
			}
		}
		
		Iterator<Integer> iter = pairs.keySet().iterator();
		int sum = 0;
		while(iter.hasNext())
		{
			sum += pairs.get(iter.next()).size();
		}
		
		return sum;
	}
	
	
	public static void main(String[] args)
	{
		Scanner inScan = new Scanner(System.in);
		
		int T = inScan.nextInt();
		//System.out.println(T);
		
		for(int t = 0; t < T; t++)
		{
			int A, B;
			
			A = inScan.nextInt();
			B = inScan.nextInt();
			//System.out.println(A);
			//System.out.println(B);
			int sum = 0;
			for(int n = A; n <= B; n++)
			{
				for(int m = B; m > n; m--)
				{
					sum += recycled(n, m);
					//System.out.println("LOOP");
				}
			}
			
			System.out.println("Case #" + (t+1) + ": " + sum);
		}
	}
}