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

import java.util.ArrayList;

import Controller.IO;

public class AllYourBaseCase extends CaseSolver {

	private String originalLine;
	private StringBuilder currentLine;
	private long numOfSeconds;

	public AllYourBaseCase(int order, int numberOfLines, IO io) {
		super(order, numberOfLines, io);
	}

	@Override
	public void addLine(String line) {
		this.originalLine = line;
		this.currentLine = new StringBuilder(line);
	}

	@Override
	public void initializeVars() {

	}

	@Override
	public void printSolution() {
		System.err.println("Case #" + getOrder() + ": " + numOfSeconds);
	}

	@Override
	public CaseSolver process() {
		ArrayList<Character> chars = getDifDigits();
		int base = chars.size() > 1 ? chars.size() : 2;
		replaceDigits(chars, base);
		numOfSeconds = getNumberInBase10(base);
		return this;
	}

	private long getNumberInBase10(int originalBase) {
		long num = 0, lenght = currentLine.length();
		for (int i = 0; i < lenght; i++) {
			num += getIntByChar(currentLine.charAt(i))
					* Math.pow(originalBase, lenght - (i + 1));
		}
		return num;
	}

	private int getIntByChar(char charAt) {
		if (charAt <= 58) {
			return charAt - 48;
		}
		return charAt - 96 + 9;
	}

	private void replaceDigits(ArrayList<Character> chars, int base) {
		replace(chars.remove(0), getNumberChar(1));
		if (chars.size() == 0) {
			return;
		}
		replace(chars.remove(0), getNumberChar(0));

		int tmp = 2;
		for (char aaa : chars) {
			replace(aaa, getNumberChar(tmp));
			tmp++;
		}
	}

	private String replace(char a, char b) {
		String temp = null;
		int index = -1;
		do {
			index = originalLine.indexOf(a, index + 1);
			if (index > -1) {
				currentLine.setCharAt(index, b);
			}
		} while (index > -1);

		return temp;
	}

	private char getNumberChar(int number) {
		if (number < 10) {
			return (char) (number + 48);
		}
		return (char) (97 + number - 10);
	}

	private ArrayList<Character> getDifDigits() {
		ArrayList<Character> tmp = new ArrayList<Character>();
		char tempChar;
		for (int i = 0; i < originalLine.length(); i++) {
			tempChar = originalLine.charAt(i);
			if (!tmp.contains(tempChar)) {
				tmp.add(originalLine.charAt(i));
			}
		}
		return tmp;
	}

}
