import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

package codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.FilenameFilter;
import java.math.BigInteger;
import java.util.HashSet;
import java.util.Set;

public class Codejam {

	private static File[] getInputFiles(String filePath) {
		File dir = new File(filePath);
		// filter .in files
		FilenameFilter onlyInFiles = new FilenameFilter() {
			public boolean accept(File file, String name) {
				return name.endsWith(".in") || file.isFile();
			}
		};
		File[] inputFiles = dir.listFiles(onlyInFiles);
		return inputFiles;
	}

	private static BigInteger binomial(final int N, final int K) {
		BigInteger ret = BigInteger.ONE;
		for (int k = 0; k < K; k++) {
			ret = ret.multiply(BigInteger.valueOf(N - k)).divide(
					BigInteger.valueOf(k + 1));
		}
		return ret;
	}

	private static Set<String> getCombinations(String numberStr, int min,
			int max) {
		// System.out.println("numberStr " + numberStr);
		Set<String> allStrings = new HashSet<String>();
		char[] numberStrChars = numberStr.toCharArray();
		String currentNumber;
		int StrLength = numberStrChars.length;
		// System.out.println("StrLength " + StrLength);
		for (int i = 0; i < StrLength - 1; i++) {
			char firstChar = numberStrChars[0];
			for (int j = 1; j < StrLength; j++)
				numberStrChars[j - 1] = numberStrChars[j];
			numberStrChars[StrLength - 1] = firstChar;
			currentNumber = new String(numberStrChars);
			// System.out.println("currentNumber " + currentNumber);
			if (!currentNumber.equals(numberStr)
					&& Integer.parseInt(currentNumber) >= min
					&& Integer.parseInt(currentNumber) <= max)
				allStrings.add(currentNumber);
		}
		return allStrings;
	}

	private static BigInteger getRecycledPairs(int min, int max) {
		//System.out.println("getRecycledPairs start");
		BigInteger recycledPairs = BigInteger.ZERO;
		Set<String> recycledPairStrings = new HashSet<String>();
		for (int i = min; i <= max; i++) {
			String currentNumber = Integer.toString(i);
			if (!recycledPairStrings.contains(currentNumber)) {
				Set<String> currentCombinations = getCombinations(
						currentNumber, min, max);
				if (currentCombinations.size() > 0) {
					recycledPairStrings.addAll(currentCombinations);
					recycledPairs = recycledPairs.add(binomial(
							currentCombinations.size() + 1, 2));
				}
			}
		}
		//System.out.println("getRecycledPairs end " + recycledPairs);
		return recycledPairs;
	}

	private static void processFile(File fileName) {
		System.out.println("Processing file " + fileName);
		try {
			// get reader for current file
			BufferedReader br = new BufferedReader(new FileReader(fileName));
			// create writer using current file + .out
			BufferedWriter bw = new BufferedWriter(new FileWriter(
					fileName.getAbsolutePath() + ".out"));
			// get test cases
			int testCases = Integer.parseInt(br.readLine());
			// process all test cases
			for (int currTestCase = 1; currTestCase <= testCases; currTestCase++) {
				String[] ab = br.readLine().split(" ");
				int A = Integer.parseInt(ab[0]), B = Integer.parseInt(ab[1]);
				BigInteger result = getRecycledPairs(A, B);
				String currTestCaseResult = "Case #" + currTestCase + ": "
						+ result;
				System.out.println(currTestCaseResult);
				bw.write(currTestCaseResult);
				bw.newLine();
			}
			// close the reader and writer
			br.close();
			bw.flush();
			bw.close();
		} catch (Exception e) {// catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		System.out.println("start");
		// get files to process
		File[] inputFiles = getInputFiles("data");
		if (inputFiles != null) {
			for (File inputFile : inputFiles)
				processFile(inputFile);
		}
	}

}
