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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Map;
import java.util.StringTokenizer;


public class RecycleNum{
	private Map<String, String> map = new HashMap<String, String>();

	public static void main(String[] args) throws IOException {
	//	new Thread(new Solution()).start();
		RecycleNum sol = new RecycleNum();
		sol.start();
	}

	public RecycleNum() {
	}

	public void start() throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
		BufferedWriter wStream=new BufferedWriter( new FileWriter("C-small_attempt0.out"));
		String input;
		StringTokenizer st=null;
		int T=0;
		if((input=br.readLine()) != null) {
			st=new StringTokenizer(input);
			T=Integer.parseInt(st.nextToken());
		}
		for(int i=0;i<T;i++)
		 {
			if((input=br.readLine()) != null) {
				st=new StringTokenizer(input);
				int A = Integer.parseInt(st.nextToken());
				int B = Integer.parseInt(st.nextToken());
				int recyclePair =0;
				for(int n=A;n<B;n++){
					for(int m=n+1;m<=B;m++){
						recyclePair += checkRecyclePair(n,m);
					}
				}
				
				System.out.println(recyclePair);
				wStream.write("Case #"+(i+1)+": "+recyclePair);
				wStream.newLine();
			//	out.print("Case #"+(testNumber+1)+": "+solve(mainList,oList,bList));
				}
			System.out.println("_________________");
			
		 }
		wStream.close();
	}
	
	public int checkRecyclePair(int n, int m){
		String nStr = Integer.toString(n);
		String mStr = Integer.toString(m);
		//System.out.println(nStr+"_"+mStr);
		String temp;
		if(nStr.length() == mStr.length()){
			for(int i=0;i<mStr.length();i++){
				if(mStr.charAt(i) == nStr.charAt(0)){
					temp = mStr.substring(i)+ mStr.substring(0, i);
					if(nStr.compareTo(temp) == 0){
					//	System.out.println(nStr+"_"+temp);
						return 1;
					}
				}
			}
			return 0;
		}
		else return 0;
	}
	
}