import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package zid;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Cycle {

	
	HashSet<String> set = new HashSet<String>();
	
	public static void main(String[] args) {
		Cycle c = new Cycle();
		c.start(args[0]);
	}


	
private void start(String filename) {
		
		try {
			
			BufferedReader br = new BufferedReader(new FileReader(filename));

			int N = Integer.parseInt(br.readLine());
			int n = 1;
			while (n <= N) {
			
				StringTokenizer st = new StringTokenizer(br.readLine());
				int A = Integer.parseInt(st.nextToken());
				int B = Integer.parseInt(st.nextToken());
				int COUNT = 0;
				set.clear();
				for (int i = A; i <= B; i++) {
					String iNum = "" + i;
					int iDigitCount = iNum.length();
					for (int j = 0; j < iDigitCount; j++) {
						iNum = getRecycled(iNum);
						int recycled = Integer.parseInt(iNum);
						int recycledDigitCount = iNum.length();
						
						if ( (i < recycled) &&
								(A <= i && recycled <= B) &&
								(recycledDigitCount == iDigitCount)
								)
							{
							String entry = String.format("%d|%d", i, recycled);
							if (!set.contains(entry)) {
								set.add(entry);
								COUNT++;
								//System.out.println(String.format("%d | %d", i,
								//		recycled));
							}
							//else
							//	System.out.println(entry);
						}
					}

				}
				
				System.out.println(String.format("Case #%d: %s", n,COUNT));
				
				n++;
				}
			
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
	}



private String getRecycled(String i) {
	String s = new String(i + "");
	
	String s2 = s.substring(s.length() - 1);
	s = s.substring(0, s.length()-1);
	s = s2 + s;
	
	
	return s;
}

	
	
}
