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.*;
import java.util.*;

public class RecycledNumbers
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader in = new BufferedReader(new FileReader("RecycledNumbers-small-attempt0.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("RecycledNumbers-small-attempt0.out", false));

		String line = in.readLine();
		int cases = Integer.parseInt(line); // # of test cases

		for (int i = 1; i <= cases; i++)
		{
			line = in.readLine();
			String[] parts = line.split(" ");
			int a = Integer.parseInt(parts[0]);
			int b = Integer.parseInt(parts[1]);

			out.write("Case #" + i + ": " + solve(a,b));
			out.newLine();
		}

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

	}

	private static int solve(int a, int b)
	{
		Set<Pair> set = new HashSet<Pair>();
		for (int i = a; i <= b; i++)
		{
			String s = Integer.toString(i);
			char f = s.charAt(0);
			for (int j = 1, len = s.length(); j < len; j++)
			{
				if (s.charAt(j) < f) continue;
				String t = s.substring(j) + s.substring(0, j);
				int k = Integer.parseInt(t);
				if (k > i && k <= b) set.add(new Pair(i, k));
			}
		}
		return set.size();
	}

	private static class Pair
	{
		private int a;
		private int b;

		public Pair(int a, int b)
		{
			this.a = a;
			this.b = b;
		}

		public int hashCode()
		{
			return (a ^ b);
		}

		public boolean equals(Object obj)
		{
			Pair that = (Pair) obj;
			return (this.a == that.a && this.b == that.b);
		}
	}
}

