import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
package RecycledNumbers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new FileReader("RecycledInput"));
		PrintWriter pw = new PrintWriter(new File("RecycledOutput"));

		String cases = br.readLine();
		String line;
		int lines = 1;
		while ((line = br.readLine()) != null) {
			String[] strs = line.split(" ");
			int lowerbound = Integer.parseInt(strs[0]);
			int upperbound = Integer.parseInt(strs[1]);
			int number = lowerbound;
			int count = 0;
//			System.out.println(numberChars.);
			while (number <= upperbound) {
				char[] numberChars = String.valueOf(number).toCharArray();
				for (int i = 0; i < numberChars.length; i++) {
					String recycled = "";
					for (int j = 0; j < numberChars.length; j++)
						recycled += numberChars[(j + i + 1)
								% numberChars.length];
					if (Integer.parseInt(recycled) <= upperbound
							&& Integer.parseInt(recycled) > number) {
						count++;
//						System.out.println(number + " " + recycled);
					}
				}
				number ++;
			}
			System.out.println("Case #" + lines + ": " + count);
			pw.write("Case #" + lines + ": " + count + "\n");
			lines++;
		
		}
		pw.flush();
		pw.close();
	}

}
