import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		//long currentTime = System.currentTimeMillis();
		Scanner inputFile = new Scanner(new InputStreamReader(System.in));
		String inputLine = null;
		String[] numberArray;
		int testCaseCount = 0;
		int startNumber = 0;
		int endNumber = 0;
		int recycledPairCount = 0;
		int digitCount = 0;
		StringBuilder recycleNumber = new StringBuilder();
		int newNumber = 0;
		String newNumberString;
		HashSet<String> recycleNumbers = new HashSet<String>();
		while (inputFile.hasNextLine()) {
			inputLine = inputFile.nextLine();
			numberArray = inputLine.split(" ");
			if(numberArray != null && numberArray.length == 1) {
				/*numberOfTestCases = Integer.parseInt(numberArray[0]);*/
			} else if (numberArray != null && numberArray.length == 2) {
				digitCount = numberArray[0].length();
				startNumber = Integer.parseInt(numberArray[0]);
				endNumber = Integer.parseInt(numberArray[1]);
				while(startNumber <= endNumber) {
					newNumberString = "" + startNumber;
					for(int i = 1; i < digitCount; i++) {
						recycleNumber = recycleNumber.append(newNumberString.substring(i) + newNumberString.substring(0, i));
						newNumber = Integer.parseInt(recycleNumber.toString());
						if(newNumber > startNumber && newNumber <= endNumber) {
							recycleNumbers.add(recycleNumber.toString());
						}
						recycleNumber.delete(0, digitCount);
					}
					recycledPairCount = recycledPairCount + recycleNumbers.size();
					startNumber++;
					recycleNumbers.clear();
				}
				System.out.println("Case #" + testCaseCount + ": " + recycledPairCount);
			}
			testCaseCount++;
			recycledPairCount = 0;
			startNumber = 0;
			endNumber = 0;
			digitCount = 0;
			newNumber = 0;
			recycleNumber.delete(0, digitCount);
		}
		//System.out.println(System.currentTimeMillis() - currentTime);
	}
}
