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


public class Main {
public static void main(String[] arg) throws FileNotFoundException
{
	Scanner scan =new Scanner(System.in);
	LinkedList<String> lilo=new LinkedList<String>();
	int t=scan.nextInt();
	for(int j=0;j<t+1;j++)
	{
		String str=scan.nextLine();
		lilo.add(str);
	}
	
	String[] str=lilo.toArray(new String[lilo.size()]);
	
	Formatter form=new Formatter("exoC.txt");
	for(int i=0;i<str.length;i++)
	{
		int u,v;
		try{
		String s=new String(str[i]);
		Scanner se=new Scanner(s);
		u=se.nextInt();
		v=se.nextInt();
		int q=calcul(u,v);
		int k=i;
		form.format("Case #"+k+": "+q+"\n");
		}catch(Exception e)
		{
			
		}
	}
	form.close();
	System.out.println("fin");
}
public static int calcul(int n,int m)
{
	int i=0;
	Methode met=new Methode();
	for(int j=n;j<=m;j++)
	{
		Integer v=new Integer(j);
		for(int k=j+1;k<=m;k++)
		{
			Integer u=new Integer(k);
			if((met.text(v.toString(), u.toString())))
			{
				i++;
			}
		}
	}
	return i;
}
}
