package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Hashtable;
import java.util.Scanner;
import java.util.Set;


public class Numbers {
public static void main(String[] args) throws Exception {
	String file="C-small-attempt0.in";
	String oFile="C-small-attempt0.out";
	BufferedReader br = new BufferedReader(new FileReader(file));
	BufferedWriter bw = new BufferedWriter(new FileWriter(oFile));
	int cases = Integer.parseInt(br.readLine());
	for(int i=1; i<=cases; i++)
	{
		bw.write("Case #"+i+": ");
		String line = br.readLine();
		String[] lineElems = line.split(" ");
		int A= Integer.parseInt(lineElems[0]);//Googlers
		int B= Integer.parseInt(lineElems[1]);//Surprising Scores
		int dig=lineElems[0].length();
		String n_j;
		int num_j;
		int cont=0;
		String code;
		for(int j=A; j<=B; j++)
		{
			n_j=""+j+""+j;
			ArrayList<String> As  = new ArrayList<String>();
			for(int k=1;k<=dig;k++)
			{
				num_j= Integer.parseInt(n_j.substring(k, k+dig));
				if (num_j>=A && num_j>j &&num_j<=B)
				{
					boolean found=false;
					for (String s: As)
					{
						if(s.compareTo(""+num_j)==0)
						{
							found=true;
							break;
						}
					}
					if(!found)
					{
						cont++;
						As.add(""+num_j);
					}
				}
				
			}
			As =null;
		}
		bw.write(""+cont);
		bw.newLine();
	}
	br.close();
	bw.close();
}
}
