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 com.nitrous.codejam;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;

public class CodeJamProblem3 {
	public static void readFile(String inputFile) throws IOException {
		File in = new File(inputFile);
		File dir = in.getParentFile();
		File outFile = new File(dir, in.getName()+".out");
		System.out.println("Output file is "+outFile.getAbsolutePath());
		PrintWriter out = new PrintWriter(outFile);
		BufferedReader reader = new BufferedReader(new FileReader(in));
		
		String line = null;
		
		int testCaseCount = Integer.parseInt(reader.readLine().trim());
		System.out.println("Read count="+testCaseCount);
		for (int testCase = 0 ; testCase < testCaseCount; testCase++) {
			line = reader.readLine();
			
			String[] numStrArr = line.split(" ");
			int min = Integer.parseInt(numStrArr[0]);
			int max = Integer.parseInt(numStrArr[1]);
			int count = 0;
			for (int current = min; current <= max; current++) {
				count += countRecycled(current, max);
			}
			
			out.println("Case #"+(testCase+1)+": "+count);
		}
		out.flush();
		out.close();
	}

	private static int countRecycled(int current, int maxValue) {
		String curAsStr = String.valueOf(current);
		int maxLen = curAsStr.length();
		HashSet<Integer> unique = new HashSet<Integer>();
		for (int len = 1; len < maxLen; len++) {
			String move = curAsStr.substring(0, len);
			String mid = curAsStr.substring(len);
			String newStr = mid + move;
			while (newStr.length() > 1 && newStr.startsWith("0")) {
				newStr = newStr.substring(1);
			}
			int newNum = Integer.parseInt(newStr);
			if (newNum > current && newNum <= maxValue) {
				unique.add(newNum);
			}
		}
		return unique.size();
	}
	
	public static void main (String[] args) throws IOException {
		readFile("D:/workspace/CodeJam/data/C-small-attempt0.in");
	}
}
