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

import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.util.BitSet;
import java.util.Scanner;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(new FileInputStream("/home/meha/eclipse-android-workspace/Code Jam/Testcase/RecycledNumbers/C-small-attempt0.in"));
		
		FileWriter out = new FileWriter("/home/meha/eclipse-android-workspace/Code Jam/Testcase/RecycledNumbers/A-small.out");
		
		int T = in.nextInt();
		for(int i = 0; i < T; i++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			int count = 0;
			
			//for(int n=A, m=B; n < m; n++,m--)
			for(int n=A; n < B; n++)	
			{
				for(int m=B; n < m; m--)
				{
					if(areRecycled(n,m))
						count++;
				}
			}
			
			int tmp = i + 1;
			out.write("Case #" + tmp + ": " + count + "\n");
			System.out.print("Case #" + tmp + ": " + count + "\n");
		}
		out.close();
		//System.out.print(areRecycled(12345, 34512));
	}

	private static boolean areRecycled(int N, int M) {
		// TODO Auto-generated method stub
		String n = Integer.toString(N);
		String m = Integer.toString(M);
		
		if(n.length() != m.length())
			return false;
		
		BitSet sChar = new BitSet(m.length());
		for(int i = 0; i < m.length(); i++)
		{
			if(m.charAt(i) == n.charAt(0))
			{
				sChar.set(i);
			}
		}
		
		
		for(int i = sChar.nextSetBit(0); i >=0; i = sChar.nextSetBit(i+1))
		{
			String mstart = m.substring(0, i);
			String mend = m.substring(i, m.length());
			String nstart =  n.substring(0, n.length() - i);
			String nend = n.substring(n.length() - i, n.length());
			
			if(nstart.equalsIgnoreCase(mend) && nend.equalsIgnoreCase(mstart))
			{
				return true;
			}
		}
		
		return false;
	}

}
