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();
	}
}


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

public class QualC{		
		
		private BufferedReader in;	
		private StringTokenizer st;
		private PrintWriter out;
		
		String rotate(String x){
			return x.substring(1)+x.charAt(0);
		}
		void solve() throws IOException{
			long t = System.currentTimeMillis();
			int size = 2000001;
			ArrayList<Integer>[]count = new ArrayList[size];
			for (int i = 0; i < count.length; i++) {
				count[i] = new ArrayList<Integer>();
			}
			for (int i = 10; i < count.length; i++) {
				String m = i+"";
				String n = m;
				do{
					n = rotate(n);
					if(n.charAt(0) != '0' && Integer.parseInt(n) < i){
						count[i].add(Integer.parseInt(n));
					}
				}while(!n.equals(m));
				
			}
			System.out.println(System.currentTimeMillis()-t);
			int kases = nextInt();
			int kase = 0;
			while(kases-->0){
				kase++;
				out.print("Case #"+kase+": ");
				int a = nextInt();
				int b = nextInt();				
				int ans = 0;
				for (int i = a+1; i <= b; i++) {
					for (int j = 0; j < count[i].size(); j++) {
						if(count[i].get(j)>=a) ans++;
					}
				}
//				for (int n = a; n <= b; n++) {
//					for (int m = n+1; m <= b; m++) {
//						String x = n+"";
//						String y = m+"";
//						if(x.length() != y.length()) continue;
//						String z = x+x;
//						if(z.contains(y)) ans++;
//					}
//				}
				out.println(ans);				
			}
		}
			

		QualC() throws IOException {
			in = new BufferedReader(new FileReader("input.txt"));	
			out = new PrintWriter(new FileWriter("output.txt"));
			eat("");
			solve();	
			out.close();
		}

		private void eat(String str) {
			st = new StringTokenizer(str);
		}

		String next() throws IOException {
			while (!st.hasMoreTokens()) {
				String line = in.readLine();
				if (line == null) {
					return null;
				}
				eat(line);
			}
			return st.nextToken();
		}

		int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public static void main(String[] args) throws IOException {
			new QualC();
		}

		int gcd(int a,int b){
			if(b>a) return gcd(b,a);
			if(b==0) return a;
			return gcd(b,a%b);
		}

}
