import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

package info.m3o.gcj2012.recyclednumber;

public class TestMainRecycledNumber {

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

		int inA, inB;
		int caseCount = 0;
		// System.out.println("T=" + inT);

		ResultUtil resultUtil = new ResultUtil();

		// inA = Integer.valueOf(s[0]);
		// inB = Integer.valueOf(s[1]);
		inA = 1000000;
		// inB = 2000000;
		inB = 2000000;
		// System.out.println("A=" + inA + "B=" + inB );
		caseCount++;

		/*
		 * Start the actual Job
		 */
		resultUtil.clearSets();
		int n, numRecycledNumber;
		RecycledNumber recycledNumber;
		for (n = inA; n <= inB; n++) {
			recycledNumber = new RecycledNumber(n, inA, inB);
			recycledNumber.addRecycledNumbers(resultUtil.recycledNumberSet,
					resultUtil.testedNumberSet);
			for (String s : RecycledNumber.getCycledNumber(recycledNumber
					.getNumStr())) {
				recycledNumber.addRecycledNumbers(resultUtil.recycledNumberSet,
						resultUtil.testedNumberSet, s);
				
			}

			// recycledNumber.addRecycledNumbers(resultUtil.recycledNumberSet,
			// resultUtil.testedNumberSet);
		}
		numRecycledNumber = resultUtil.recycledNumberSet.size();

		System.out.print("Case #" + caseCount + ": ");
		System.out.println(numRecycledNumber);
//		for (MyNumberStringPair mnsp : resultUtil.recycledNumberSet) {
//			System.out.println("(" + mnsp.getS1() + ", " + mnsp.getS2() + ") ");
//		}
//		 System.out.println("END");

		// System.out.println("TestRecycleat = " +
		// RecycledNumber.testrecycleAt());

		// System.out.println("caseCount="+caseCount);
		// assert (inT == caseCount) : "CaseCount mismatch";

	}

}
