package it.simone.google.code.jam2012;

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

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

import java.io.*;
public class RecycledNo
{
public static void main (String arg[]) throws Exception
{
BufferedReader ob=new BufferedReader (new FileReader("C-large.in"));

PrintWriter pw=new PrintWriter ("output.txt");

String temp="";
temp=ob.readLine();
int t=Integer.parseInt(temp);
int a=0,b=0;

for(int l=1;l<=t;l++)
{
 temp=ob.readLine();
 String str="";

 for(int i=0;i<temp.length();i++)
 {
  char ch=temp.charAt(i);
  if(ch==' ')
  {
  a=Integer.parseInt(str);
  str="";
  continue;
  }
  str=str+ch;
 } 
 b=Integer.parseInt(str); 
 int count=0;
 str="";
 for(int k=a;k<=b;k++) 
 {
  str=""+k;
  String s[]=new String[str.length()];
  for(int i=0;i<str.length();i++)
  {
  char ch=str.charAt(i);
  s[i]=""+ch;
  }
  for(int i=1;i<str.length();i++)
  {
  temp=s[0];
  for(int j=0;j<str.length()-1;j++)
  {
  s[j]=s[j+1];
  }
  s[str.length()-1]=temp;
  String R="";
  for(int j=0;j<str.length();j++)
  {
  R=R+s[j];
  }
  int tmp=Integer.parseInt(R);
  if(tmp<=b && tmp>k)
  count++;
  }
 }
 temp="Case #"+l+": "+count;
 pw.println(temp);
}
pw.close();
}
}
