
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

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

public class Q3 {

	static int m1(String s) {
		int count=0;
		Scanner sc=new Scanner(s);
		int a=sc.nextInt(), b=sc.nextInt();
		String s1=null, s2=null;
		for (int n=a; n<b; n++)
		{
			for (int m=n+1; m<=b; m++)
			{
				s1=String.valueOf(n); s2=String.valueOf(m);
				if (s1.length()==s2.length())
				{
					List<String> iso=new ArrayList<String>();
					for (int i=0; i<s1.length()-1; i++)
						iso.add(s1.substring(s1.length()-i-1)+s1.substring(0, s1.length()-i-1));
					for (String ss:iso)
						if (ss.equals(s2))
							count++;
				}
			}
		}
		return count;
	}
	public static void main(String[] args) throws IOException {
		File inFile=new File("C-small-attempt0.in");
		File outFile=new File("C-small-attempt0.out");
		BufferedReader br=new BufferedReader(new FileReader(inFile));
		PrintWriter out=new PrintWriter(new FileWriter(outFile));
		StringBuilder sb=new StringBuilder();
		int ntc=Integer.parseInt(br.readLine());
		for (int tc=1; tc<=ntc; tc++)
		{
			String s=br.readLine();
			sb.append("Case #"+tc+": "+m1(s)+"\n");
		}
		out.write(sb.toString());
		br.close();
		out.close();
	}
}
