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

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

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