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

public class DataModel extends Thread {

	class Data {
		private int no;
		private List<Integer> pairs;

		public Data(int no) {
			this.no = no;
			pairs = new Vector<Integer>();
		}

		public void addToList(int no) {
			pairs.add(no);
		}

		public int getPairs() {
			int p = 0;
			for (Integer i : pairs) {
				if (i != no)
					p++;
			}
			return p;
		}

		public boolean isInList(int i) {
			return pairs.contains(i);
		}

	}

	private int lowBound;
	private int highBound;
	private int caseNo;
	private Data[] range;
	private int output;
	private boolean stateCalc;

	public DataModel(String input, int caseNo) {
		this.caseNo = caseNo;
		String[] temp = input.split(" ");
		stateCalc = false;
		try {
			lowBound = Integer.parseInt(temp[0]);
			highBound = Integer.parseInt(temp[1]);
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
		range = new Data[highBound - lowBound + 1];
		for (int i = lowBound; i <= highBound; i++) {
			range[i - lowBound] = new Data(i);
		}
	}

	@Override
	public void run() {
		char[] split;
		int splitOn;
		for (int i = lowBound; i <= highBound; i++) {
			split = (i + "").toCharArray();
			if (split.length == 1) {
				output = 0;
				break;
			}
			for (int j = 0; j < split.length; j++) {

				splitOn = splitOnPos(split, j);
				if (splitOn <= highBound && splitOn >= lowBound && splitOn != i) {
					if (!range[i - lowBound].isInList(splitOn)) {
						range[i - lowBound].addToList(splitOn);
					}
				}
			}
		}
		calcOut();

		stateCalc = true;
	}

	private void calcOut() {
		for (int i = 0; i < range.length; i++) {
			for (int j = 0; j < range[i].getPairs(); j++)
				output++;
		}
		output /= 2;
	}

	private int splitOnPos(char[] arr, int splitpos) {
		StringBuilder sb = new StringBuilder();
		for (int i = splitpos; i < arr.length; i++) {
			sb.append(arr[i]);
		}
		for (int i = 0; i < splitpos; i++) {
			sb.append(arr[i]);
		}
		return Integer.parseInt(sb.toString());
	}

	public boolean isDone() {
		return stateCalc;
	}

	public void getOutput() {
		System.out.println("Case #" + caseNo + ": " + output);
	}
}