import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;

public class ReadFile {
	public static void main(String[] args) throws Exception {
		String srcFile = "C:" + File.separator + "Documents and Settings"
				+ File.separator + "rohit" + File.separator + "My Documents"
				+ File.separator + "Downloads" + File.separator
				+ "C-small-attempt1.in.txt";
		String destFile = "C:" + File.separator + "Documents and Settings"
				+ File.separator + "rohit" + File.separator + "My Documents"
				+ File.separator + "Downloads" + File.separator
				+ "C-small-attempt0.out";
		File file = new File(srcFile);
		List<String> readData = new ArrayList<String>();
		FileReader fileInputStream = new FileReader(file);
		BufferedReader bufferedReader = new BufferedReader(fileInputStream);
		StringBuilder stringBuilder = new StringBuilder();
		String line = null;
		while ((line = bufferedReader.readLine()) != null) {
			readData.add(line);
		}
		stringBuilder.append(generateOutput(readData));
		File writeFile = new File(destFile);
		if (!writeFile.exists()) {
			writeFile.createNewFile();
		}
		FileWriter fileWriter = new FileWriter(writeFile);
		BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);
		bufferedWriter.write(stringBuilder.toString());
		bufferedWriter.close();
		System.out.println("output" + stringBuilder);
	}

	/**
	 * @param number
	 * @return
	 */
	private static String generateOutput(List<String> number) {
		StringBuilder stringBuilder = new StringBuilder();
		for (int i = 0; i < number.size(); i++) {
			if (i == 0) {
				continue;
			} else {
				String tempString = number.get(i);
				String[] temArr = tempString.split(" ");
				stringBuilder.append("Case #" + i + ": ");
				stringBuilder.append(getRecNumbers(temArr[0], temArr[1]));
				stringBuilder.append("\n");
			}
		}
		if (stringBuilder.length() > 0) {
			stringBuilder.deleteCharAt(stringBuilder.length() - 1);
		}
		return stringBuilder.toString();
	}

	// /* This method accepts method for google code jam */
	// private static String method(String value) {
	// int intValue = Integer.valueOf(value);
	// double givenExpr = 3 + Math.sqrt(5);
	// double num = Math.pow(givenExpr, intValue);
	// String valArr[] = (num + "").split("\\.");
	// int finalVal = Integer.valueOf(valArr[0]) % 1000;
	//
	// return String.format("%1$03d", finalVal);
	//
	// }
	//
	// /* This method accepts method for google code jam */
	// private static String method2(String value) {
	// StringTokenizer st = new StringTokenizer(value, " ");
	// String test[] = value.split(" ");
	// StringBuffer str = new StringBuffer();
	//
	// for (int i = 0; i < test.length; i++) {
	// // test[i]=test[test.length-i-1];
	// str.append(test[test.length - i - 1]);
	// str.append(" ");
	// }
	// str.deleteCharAt(str.length() - 1);
	// String strReversedLine = "";
	//
	// while (st.hasMoreTokens()) {
	// strReversedLine = st.nextToken() + " " + strReversedLine;
	// }
	//
	// return str.toString();
	// }

	private static int getRecNumbers(String no1, String no2) {

		int a = Integer.valueOf(no1);
		int b = Integer.valueOf(no2);
		Set<String> dupC = new HashSet<String>();
		for (int i = a; i <= b; i++) {
			int n = i;
			List<String> value = findPerm(n);
			for (String val : value) {
				if (Integer.valueOf(val) <= b && Integer.valueOf(val) >= a
						&& n < Integer.valueOf(val)) {
					dupC.add(n + "-" + val);
				}
			}
		}
		return dupC.size();
	}

	private static List<String> findPerm(int num) {
		String numString = String.valueOf(num);
		List<String> value = new ArrayList<String>();
		for (int i = 0; i < numString.length(); i++) {
			String temp = charIns(numString, i);
			if (!temp.equalsIgnoreCase(numString)) {
				value.add(charIns(numString, i));
			}
		}
		return value;

	}

	public static String charIns(String str, int j) {
		String begin = str.substring(0, j);
		String end = str.substring(j);
		return end + begin;
	}
}
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.TreeSet;
import java.util.Vector;


public class User {

	private static final String FILENAME = "C-small-attempt0.in";
	private static final String OUTFILENAME = "C-small-attempt0.out";
	public static String newline = System.getProperty("line.separator");

	public static void main(String[] args) throws Exception {
		
	//	System.out.println(decoder.keySet());
	//	System.out.println(decoder.values());
		
		PrintWriter out = new PrintWriter(new FileWriter(OUTFILENAME));
	//	PrintStream out = System.out;
		

		FileReader fr = null;
		try {
			fr = new FileReader(FILENAME);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		BufferedReader input = new BufferedReader(fr);
		
		String[] line;
		String n;
		int digCount;
		String m;
		int recycledPairs = 0;
		
		int T = Integer.parseInt(input.readLine());
		
		for (int t=0; t<T; t++){
			HashMap<String, TreeSet<Integer>> digitMap = new HashMap<String, TreeSet<Integer>> ();
			recycledPairs = 0;
			line = input.readLine().split(" ");
			n = line[0];
			m = line[1];
			int nInt = Integer.parseInt(n);
			int mInt = Integer.parseInt(m);
						
			for (int i = nInt; i<=mInt; i++){
				String myChars = findChars(i); 
				if (digitMap.containsKey(myChars)){
					digitMap.get(myChars).add(i);
				//	System.out.println ("adding "+ i + " to "+ myChars + " new size is " + digitMap.get(myChars).size());
				}
				else {
					TreeSet<Integer> myTreeSet = new TreeSet<Integer>();
					myTreeSet.add(i);
					digitMap.put(myChars, myTreeSet);
				//	System.out.println ("adding "+ i + " to "+ myChars + " new size is " + digitMap.get(myChars).size());
				}
			}
			
			for (TreeSet<Integer> myTreeSet : digitMap.values()){
				if (myTreeSet.size()>1){
					Integer[] setArray = myTreeSet.toArray(new Integer[0]);
					int saLen = setArray.length;
					for (int i = 0; i<saLen; i++)
						for (int j = i+1; j<saLen;j++)
							if(recycled(setArray[i], setArray[j])) recycledPairs++;
				}
			}
			
/*
			for (int i = 0; i<7; i++)	
				for (int j = 0; j<magSet.get(i).size(); j++)
					for (int k = j+1; k<magSet.get(i).size();k++)
						if(recycled(magSet.get(i).get(j), magSet.get(i).get(k))) recycledPairs++;
	*/					
				
			out.println("Case #" + (t+1) + ": "+recycledPairs);
		}
			
		input.close();
		fr.close();
		out.close();
	}

	private static boolean recycled(Integer n, Integer m) {
		
		//System.out.println("recycling: " + n + "; "+ m);
		
		String nStr = n.toString();
		int strLen = nStr.length();
		String mStr = m.toString();
		
		for (int i=0; i < strLen-1; i++){
			nStr = moveDigit(nStr);
		//	System.out.println("comparing: " + nStr + "; "+ mStr);
			if (nStr.equals(mStr)) return true;
		}
		
		return false;
	}

	private static String findChars(int i) {
		char[] myCharArray= Integer.toString(i).toCharArray();
		Arrays.sort(myCharArray);
		return new String(myCharArray);
	}


	private static int countDigits(String next) {
		// TODO Auto-generated method stub
		return next.length();
	}

	private static String moveDigit(String n){
		StringBuffer nString = new StringBuffer(n);
		if (nString.length() == 1) return n; 
		StringBuffer resultString = new StringBuffer();
		resultString.append(nString.charAt(nString.length()-1));
		resultString.append(nString.substring(0, nString.length()-1));
		
		return new String(resultString);
	}
	
	private static int countDigits (int i){
		StringBuffer nString = new StringBuffer(Integer.toString(i));
		 return nString.length(); 
	}

}
