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

}
package info.m3o.gcj2012.recyclednumber;

import java.util.HashMap;

public class MyNumberStringPair implements Comparable<MyNumberStringPair> {

	protected String s1;
	protected String s2;
		
	public MyNumberStringPair(String str1, String str2){
/*		assert (str1.compareTo(str2) != 0) : "Identical Strings cannot be paired.";
		if (str1.compareTo(str2) != 0){
			return;
		}
*/
		if (str1.compareTo(str2) < 0 ){
			s1 = new String(str1);
			s2 = new String(str2);
		}
		else{
			s1 = new String(str2);
			s2 = new String(str1);
		}
	}

	public String getS1() {
		return s1;
	}


	public void setS1(String s1) {
		this.s1 = s1;
	}


	public String getS2() {
		return s2;
	}


	public void setS2(String s2) {
		this.s2 = s2;
	}


	@Override
	public int compareTo(MyNumberStringPair o) {
		// TODO Auto-generated method stub
		int c1, c2;
		c1 =this.s1.compareTo(o.s1);
		c2 = this.s2.compareTo(o.s2);

		if ((c1 == 0 ) && (c2 ==0))	
			return 0;

		if ( c1 != 0 ){
			return c1;
		}
		return c2;


	}


	

}
