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

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

class RecycledPair
{
	int a; 
	int b;
	
	public RecycledPair(int a, int b) {
		super();
		this.a = a;
		this.b = b;
	}

	@Override
	public int hashCode() {
		final int PRIME = 31;
		int result = 1;
		result = PRIME * result + (a + b);
		result = PRIME * result + (a + b);
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		final RecycledPair other = (RecycledPair) obj;
		if (a == other.a && b==other.b)
			return true;
		if (a == other.b && b==other.a)
		    return true;
		return false;
	}
	
	
	
}
public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();

		in.nextLine();

		for (int t = 0; t < T; t++) {
			String s = in.nextLine();
			String[] limit = s.split(" ");
			int A = Integer.parseInt(limit[0]);
			int B = Integer.parseInt(limit[1]);

			Set<RecycledPair> recycledPairsEncountered = new HashSet<RecycledPair>();

			int count = 0;
			for (int i = A; i <= B; i++) 
			{
				char[] num = String.valueOf(i).toCharArray();

				for (int k = num.length - 1; k >= 1; k--) 
				{
					String recycledNumber = "";
					if (num[k] != '0') 
					{
						int indx = k;
						while (indx < num.length)
							recycledNumber += num[indx++];
						indx = 0;
						while (indx < k)
							recycledNumber += num[indx++];
					}

					if (!recycledNumber.equals("")) 
					{
						int recycledNum = Integer.parseInt(recycledNumber);

						if (recycledNum != i
								&& recycledNum <= B
								&& recycledNum >= A)
						{
						     RecycledPair r = new RecycledPair(i, recycledNum);	
						     if(recycledPairsEncountered.contains(r)==false)
						     {
						    	 recycledPairsEncountered.add(r);
						     	 count++;
						     }
						}
					}
				}
			}

			System.out.println("Case #" + (t + 1) + ":" + " " + count);
		}
	}

}
