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 recycledNumbers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

import dancers.DancerEvaluation;

public class RecycledNumberFinder {

    public int findNumbers(int startPoint, int endPoint) {

	List<Pair> lstOfRecycledPairs = new ArrayList<RecycledNumberFinder.Pair>();

	for (int i = startPoint; i < endPoint; i++) {

	    String numberToBeChecked = Integer.toString(i);

	    char[] number = numberToBeChecked.toCharArray();

	    for (int j = 1; j < number.length; j++) {
		char[] prepend = Arrays.copyOfRange(number, number.length - j, number.length);
		char[] append = Arrays.copyOfRange(number, 0, number.length - j);
		String recycledNumberAsString = (new String(prepend) + new String(append));
		int recycledNumber = Integer.parseInt(recycledNumberAsString);
		if( recycledNumber <= endPoint && recycledNumber > i){
 		    Pair p = new Pair(i, recycledNumber);
 		    if(!lstOfRecycledPairs.contains(p))
 			lstOfRecycledPairs.add(p);
		}

	    }



	}


	return lstOfRecycledPairs.size();

    }

    public class Pair{
	private final int x;
	private final int y;

	public int getX() {
	    return x;
	}

	public int getY() {
	    return y;
	}

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

	}

	@Override
	public boolean equals(Object obj) {
	    Pair objPair = (Pair) obj;
	    return getX() == objPair.getX() && getY() == objPair.getY();
	}

    }


    public static void main(String[] args) throws Exception{
	BufferedReader reader = new BufferedReader(new FileReader(new File("C:\\Users\\maheshsa\\Desktop\\input.txt")));
	int numOfTestCases = Integer.parseInt(reader.readLine());
	FileWriter fw = new FileWriter(new File("C:\\Users\\maheshsa\\Desktop\\output.txt"));
	for (int i = 1; i <= numOfTestCases; i++) {
	    String[] inputAsString = reader.readLine().split(" ");
	    int[] input = new int[inputAsString.length];
	    for (int j = 0; j < inputAsString.length; j++) {
		input[j] = Integer.parseInt(inputAsString[j]);
	    }
	    int startPoint = input[0];
	    int endPoint = input[1];
	    fw.append("Case #" + i + ": " + new RecycledNumberFinder().findNumbers(startPoint, endPoint) + "\n");
	}

	fw.flush();

	reader.close();
	fw.close();
    }


}
