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.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;

public class RecycledNumbers {
	
	public static int nonbelong(int n, int [] T)
	{
		int j=1;
		int i;
		for (i=0;i<T.length;i++)
		{
			if (T[i]==n){j=0;}
		}
		return j;
	}

	public static  int longeur(int n )
	{
		String ch= new String();
		ch=String.valueOf(n);
		return ch.length();
	}
	public static  int rotation(int n, int p )
	{
		String ch=new String();
		String ch2=new String();
		String ch3=new String();
		ch=String.valueOf(n);
		int l=ch.length();
		if (p>l) return 0;
		else
		{
			ch2=ch.substring(l-p);
			if (Integer.valueOf(ch2)==0){ return 0;}
			else
			{
			ch3=ch.substring(0, l-p);
			ch=ch2+ch3;
			return Integer.valueOf(ch);
			}
		}
		
	}
	public static void main(String[] args) throws IOException{
		
		String fichierentree= "/home/marwen/TÃ©lÃ©chargements/C-small-attempt0.in";
		String fichiersortie= "/home/marwen/Bureau/output.in";

		BufferedWriter	 wr= new BufferedWriter(new FileWriter(fichiersortie));
		DataInputStream	 rd= new DataInputStream(new FileInputStream(fichierentree));	
		
		
		int i,l,nb,r,j,a,b,k;
		
		
		String ligne= rd.readLine();
		int T= Integer.valueOf(ligne);		
		
		for (k=1;k<=T;k++)
		{
			nb=0;
			ligne=rd.readLine();
			a=Integer.valueOf(ligne.substring(0, ligne.indexOf(" ")));
			b=Integer.valueOf(ligne.substring(ligne.indexOf(" ")+1));
		
			l=RecycledNumbers.longeur(a);
			int [] Valr=new int[l-1];
			for(i=0;i<l-1;i++){Valr[i]=0;};
			for (i=a;i<b;i++)
			{
				for (j=1;j<=l-1;j++)
				{
					r=RecycledNumbers.rotation(i, j);
					if (RecycledNumbers.nonbelong(r, Valr)==1)
					{
						Valr[j-1]=r;
						if ((r>0)&&(r<=b)&&(r>a)&&(r>i)){nb++;}
					}
				}
			}
			
			wr.write("Case #"+k+": "+nb);
			wr.newLine();
			
		}
		
	wr.close();
	rd.close();
	}

}
