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

import java.awt.Desktop;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;

public abstract class ContestProblem {

	File inputFile = new File("input.txt");
	File outputFile = new File("output.txt");

	public ContestProblem() {

	}

	public ContestProblem(String inputFilename) {
		this.inputFile = new File(inputFilename);
		calcOutputFromInput();
	}

	public void run() throws Exception {
		BufferedReader in = new BufferedReader(new FileReader(inputFile));
		PrintWriter out = new PrintWriter(new FileWriter(outputFile));
		try {
			parseInput(new Input(in), out);
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		out.close();
		in.close();
	}

	public abstract void parseInput(Input in, PrintWriter out);

	public static void runProblem(ContestProblem problem) {
		try {
			long start = System.currentTimeMillis();
			problem.run();
			long end = System.currentTimeMillis();
			System.out.format("Took: %d ms%n", end - start);
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		try {
			if (Desktop.isDesktopSupported()) {
				Desktop.getDesktop().open(problem.outputFile);
			}
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

	public File getInputFile() {
		return inputFile;
	}

	public ContestProblem setInputFile(File inputFile) {
		this.inputFile = inputFile;
		return this;
	}

	public File getOutputFile() {
		return outputFile;
	}

	public ContestProblem setOutputFile(File outputFile) {
		this.outputFile = outputFile;
		return this;
	}

	public ContestProblem calcOutputFromInput() {
		this.outputFile = new File(inputFile.getParentFile(), inputFile.getName() + "-output.txt");
		return this;
	}
}
