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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class Prob3 {

	
	public static int calc(int n1, int n2){
		Set<String> set = new HashSet();
		int c=0;
		for(;n1<=n2;n1++){
			String sn = ""+n1;
			Set<String> tested = new HashSet();
			for(int i=0;i<sn.length();i++){				
				String s = sn.substring(i,sn.length())+sn.substring(0,i);
				if(s.charAt(0)=='0') continue;
				if(tested.contains(s)) continue; 
				tested.add(s);
				int s2 = Integer.parseInt(s);
				if(set.contains(s) && s2>=n1 && s2<=n2){
					c++;
				}else{
					set.add(s);
				}
			}
			
		}
		return c;
	}
	
	public static void main(String[] args) {
			
		try{

		  FileInputStream fstream = new FileInputStream("C-large.in");

		  DataInputStream in = new DataInputStream(fstream);
		  BufferedReader br = new BufferedReader(new InputStreamReader(in));
		  String strLine;

		  FileWriter fstream1 = new FileWriter("C-large.out");
		  BufferedWriter out = new BufferedWriter(fstream1);
//		  out.write("Hello Java");
		  //Close the output stream
		  
		  
		  long l = Long.parseLong(br.readLine());
		  for(long i=0; i<l && (strLine = br.readLine()) != null; i++)   {
			  String[] s = strLine.split(" "); 
			  int res = calc(Integer.parseInt(s[0]), Integer.parseInt(s[1]));
			  System.out.println("Case #"+(i+1)+": " +res);
			   out.write("Case #"+(i+1)+": " +res+"\n");
			  
			 // System.out.println("\n\n\n\n\n\n\n\n");
		  }			
		  out.close();
		} catch (Exception e1){
	    	e1.printStackTrace();
		}
	}
		
}
