package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
public class C {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader input = new BufferedReader(new InputStreamReader(System.in));

		int n = Integer.parseInt(input.readLine());

		for(int j=0;j<n;j++){
			char[] numbers;
			char[] newNumbers;
			int newNumber=-1;
			int count = 0;

			String AB[] = input.readLine().split(" ");
			int A = Integer.parseInt(AB[0]);
			int B = Integer.parseInt(AB[1]);


			for(Integer original= B; original>A;original--){
				numbers = original.toString().toCharArray();
				perm:
					do{
						newNumbers = new char[numbers.length];
						newNumbers[0]=numbers[numbers.length-1];

						for(int i=1; i<numbers.length ;i++){
							newNumbers[i]=numbers[i-1];
						}
						numbers = newNumbers.clone();
//						if(numbers[0]=='0'){
//							continue perm;
//						}
						newNumber = charToInt(newNumbers);
						if (newNumber>B || newNumber<A){
							continue perm;
						}
						if(newNumber<=B && newNumber>=A && newNumber<original){
							count++;
							//System.out.print(newNumber+"\n");
						}
					}while(newNumber!=original);
			}
			System.out.print("Case #" +(j+1) + ": " + count +"\n");
		}
	}
	public static int charToInt(char[] number){
		int value=0;
		for(int i=0;i<number.length;i++){
			value+= (number[number.length-1-i]-48)*Math.pow(10, i);
		}
		return value;
	}

}
