import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

package com.gcj.parser;

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

public class Number {

	private static List<Integer> getRecylcedCombining(int value){

		List<Integer> toReturn = new ArrayList<Integer>();
		
		Integer intValue = new Integer(value);
		String strValue = intValue.toString();
		
		for (int i = 1; i < strValue.length() ; i ++) {
			Integer newValue = new Integer(strValue.substring(i, strValue.length()) + strValue.substring(0, i));
			if (newValue.intValue() > value && !toReturn.contains(newValue)){
				toReturn.add(newValue);
			}
		}
		
		return toReturn;
	}
	
	public static int nbOfRecycledInteger(int min, int max){
		int toReturn = 0;
//		boolean[] alreadyDone = new boolean[10000000];
		
		for (int i = min ; i <= max ; i++){
			List<Integer> list = getRecylcedCombining(i);
			
			for (Integer number : list){
				int intNumber = number.intValue();
				if (intNumber >= min && intNumber <= max ){//&& !alreadyDone[intNumber]){
					toReturn++;
//					alreadyDone[intNumber]=true;
				}
			}
		}
		
		return toReturn;
	}

	
	public static void main(String[] args) {
	
		System.out.println(nbOfRecycledInteger(1111, 2222));
		
	}
}
