
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.io.IOException;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.HashSet;
import java.util.List;
import java.util.Set;


public class Recycled {
	
	public static void main(String[] args) throws IOException {
		Path input = Paths.get("/Users/mdymczyk/google-codejam/Tongues/src/input.in");
		List<String> lines = Files.readAllLines(input, Charset.forName("UTF-8"));
		lines.remove(0);
		int i = 1;
		for(String line : lines) {
			Set<Pair> pairs = new HashSet<Pair>();
			StringBuilder sb = new StringBuilder();
			sb.append("Case #"+i+": ");
		
			int lower = Integer.parseInt(line.split(" ")[0]); 
			int upper = Integer.parseInt(line.split(" ")[1]); 
			int length = line.split(" ")[0].length();
			
			for(int j = lower ; j <= upper ; j++) {
				for(int k = 1; k < length; k++) {
					int rearranged = rearrangeLastNDigits(j, k);
					if(rearranged != j && (rearranged >= lower && rearranged <= upper)){
						pairs.add(new Pair(j, rearranged));
					}
				}
			}
			sb.append(pairs.size());
			System.out.println(sb);
			i++;
		}
	}

	private static int rearrangeLastNDigits(int j, int k) {
		String stringRepresentation = Integer.toString(j);
		String reordered = stringRepresentation.substring(k, stringRepresentation.length()) + stringRepresentation.substring(0, k);
		return Integer.parseInt(reordered);
	}
	
}

class Pair {
	int n, m;

	public Pair(int n, int m) {
		this.n = n;
		this.m = m;
	}
	
	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * m*n;
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		Pair other = (Pair) obj;
		if (m != other.m && m != other.n)
			return false;
		if (n != other.n && n != other.m)
			return false;
		return true;
	}
}
