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.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.Scanner;

class MyPair
{
	public int one = 0;
	public int two = 0;
};

public class ProblemC 
{
	
	
	public static boolean has(int one, int two, LinkedList<MyPair> list)
	{
		for (int i = 0; i < list.size(); i += 1)
		{
			MyPair p = list.get(i);
			
			if (p.one == one && p.two == two) return true;			
		}
		return false;
	}
	public static void add(int one, int two, LinkedList<MyPair> list)
	{
		MyPair p = new MyPair();
		
		p.one = one;
		p.two = two;
		
		list.add(p);
	}
	public static LinkedList<String> strswp(int b)
	{
		String str = b+"";
		LinkedList<String> q = new LinkedList<String>();
		LinkedList<Character> ch = new LinkedList<Character>();
		
		for(int i = 0 ; i < str.length() ; i+=1)
		{
			ch.add(str.charAt(i)) ;
		}
		for(int i = 0 ; i < str.length()-1 ; i+=1)
		{
			String kp = "";
			ch.addFirst(ch.pollLast());
			
			for(int j = 0 ; j < ch.size() ; j++)
			{
				kp += ch.get(j);
			}
			if(kp.charAt(0) != '0' && !kp.equals(str))
			{
				q.add(kp);
			}
			
		}
		
		return q;
	}

	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new File("C:\\C-small-attempt1.in"));
		//Scanner sc = new Scanner(new File("C:\\toy.txt"));
		PrintWriter pw = new PrintWriter(new File("C:\\out"));
		int nl = Integer.parseInt(sc.next());
		for(int n = 0 ; n < nl ; n+=1)
		{
			int a = Integer.parseInt(sc.next());
			int b = Integer.parseInt(sc.next());
			int cnt = 0 ;
			LinkedList<String> listcmp = new LinkedList<String>();
			LinkedList<MyPair> mem = new LinkedList<MyPair>();
			
			for(int i = a ; i <= b ; i+=1)
			{
				listcmp = strswp(i);
				
				for(int j = 0 ; j < listcmp.size() ; j+=1)
				{
					int c = Integer.parseInt(listcmp.get(j));
					
					boolean hasss = i < c ? has(i, c, mem) : has(c, i, mem);
					if(c >= a && c<=b && i >= a && i <= b && !hasss)
					{					
						cnt ++;
						//System.out.println(" a = " + i + ", b = " + c);
						if(i<c)
						{
							add(i, c, mem);
						}
						else
						{
							add(c,i,mem);
						}
						//break;
					}
				}
			}

			pw.println("Case #"+(n+1)+": "+cnt);
			pw.flush();
			
			System.out.println("Case #"+(n+1)+": "+cnt);
		
		}
		pw.close();
	}
}
