
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
package com.google.codejam.p3;

import java.awt.Point;
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Problem3 {

	ArrayList<Point> cases = new ArrayList<Point>();

	public void loadInput() {
		try{
			FileInputStream fstream = new FileInputStream("input3.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine = br.readLine(); //read number of lines
			while ((strLine = br.readLine()) != null) {
				String[] info = strLine.split(" ");
				int A = Integer.parseInt(info[0]);
				int B = Integer.parseInt(info[1]);
				cases.add(new Point(A,B));
			}
			in.close();
		}
		catch (Exception e) { }
	}
	
	public static boolean isRecycled(int a, int b) {

		String s1 = Integer.toString(a);
		String s2 = Integer.toString(b);
		for (int i=0; i<s1.length(); i++) {
			String tmpS = s2.substring(0, s2.length()-1); 
			char lastC = s2.charAt(s2.length()-1);
			s2 = lastC + tmpS;
			if (s2.equals(s1))
				return true;
		}
		return false;
	}
	
	public void getOutput() {
		for (int x=0; x<cases.size(); x++) {
			int A = cases.get(x).x;
			int B = cases.get(x).y;
			int total = 0;
			for (int i=A; i<B; i++) 
				for (int j=i+1; j<=B; j++)
					if (isRecycled(i, j))
						total++;
			System.out.println("Case #" + (x+1) + ": " + total);
		}
	}
	
	
	public static void main(String[] args) {
		Problem3 p = new Problem3();
		p.loadInput();
		p.getOutput();
	}

}
