import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package qualification;

import java.util.ArrayList;
import java.util.List;
import java.util.Vector;

import core.ExtendedBufferedReader;
import core.Template;

public class ProblemC extends Template {

	int _numberOfCases;
	Vector<List<Integer>> _cases = new Vector<List<Integer>>();

	@Override
	public void feedData(ExtendedBufferedReader iR) {
		// TODO Auto-generated method stub

		_numberOfCases = iR.getIntFL();

		for (int i=0; i<_numberOfCases; i++){

			_cases.add(iR.getIntListFL());

		}

	}

	public String rotRight(String iData){
		return iData.charAt(iData.length()-1)+iData.substring(0,iData.length()-1);
	}

	@Override
	public StringBuffer applyMethods() {
		// TODO Auto-generated method stub

		StringBuffer aBF = new StringBuffer();

		for (int i=0; i<_cases.size(); i++){

			List<Integer> aCase = _cases.elementAt(i);

			int A = aCase.get(0);
			int B = aCase.get(1);
			int count = 0;
			
			for (int n=A; n<=B; n++){



				String repN = (new Integer(n)).toString();
				String repM = repN;
				int aSize = repN.length();

				if (aSize>1) {

					List<Integer> aMExists = new ArrayList<Integer>();
					
					for (int j=0;j<aSize;j++) {

						repM = rotRight(repM);

						int rN = new Integer(repN).intValue();
						int rM = new Integer(repM).intValue();
						
						if ((rN<rM) && (rM<=B) && (!aMExists.contains(new Integer(rM)))) {
							count++;
							aMExists.add(new Integer(rM));
							//System.out.println("n="+repN+",m="+repM);
						} 
						
					}

				}
			}
			aBF.append("Case #"+(i+1)+": "+count+"\n");

		}

		return aBF;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		new ProblemC().play(args);

	}

}
