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.hingom.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class RecycledNumbers {
	
	private boolean pairs(String sn, String sm) {
		char[] cn = sn.toCharArray();
		char[] cm = sm.toCharArray();
		char[] temp = new char[cm.length];
		
		for (int i = 0; i < cn.length; i++) {
			if (cn[0] == cm[i]) {
				int p = 0;
				for (int s = i; s < cn.length; s++) {
					temp[p++] = cm[s];
				}
				for (int s = 0; s < i; s++) {
					temp[p++] = cm[s];
				}
				if (sn.equals(new String(temp))) {
					return true;
				}
			}
		}
		
		return false;
	}
	
	public void run() {
		File input = new File("resources/C-small-attempt0.in");
		File output = new File("resources/output");
		BufferedReader reader = null;
		BufferedWriter writer = null;
		
		try {
			reader = new BufferedReader(new FileReader(input));
			writer = new BufferedWriter(new FileWriter(output));

			int testCases = Integer.parseInt(reader.readLine());
			
			StringBuilder o = new StringBuilder();
			
			for (int loop = 1; loop <= testCases; loop++) {
				String line = reader.readLine();
				String[] numbers = line.split(" ");
				
				int a = Integer.parseInt(numbers[0]);
				int b = Integer.parseInt(numbers[1]);
				
				int count = 0;
				o.delete(0, o.length());
				for (int n = a; n < b; n++) {
					for (int m = n + 1; m <= b; m++) {
						String sn = Integer.toString(n);
						String sm = Integer.toString(m);

						if (pairs(sn, sm)) {
							count++;
						}
					}
				}
				
				writer.write(String.format("Case #%d: %d", loop, count));
				writer.newLine();
			}
			
			writer.flush();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try { if (reader != null) reader.close(); } catch (Exception e) {}
			try { if (writer != null) writer.close(); } catch (Exception e) {}
		}
	}

	public static void main(String[] args) {
		RecycledNumbers recycledNumbers = new RecycledNumbers();
		recycledNumbers.run();
	}
}
