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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;


public class RecycledNumbers {
	String filename;
	BufferedReader br;
	PrintWriter pw;
	
	public RecycledNumbers(String filename) throws FileNotFoundException {
		this.filename = filename;
		br = new BufferedReader(new FileReader(filename));
		pw = new PrintWriter("output-3.txt");
	}
	
	public void processInput() throws NumberFormatException, IOException {
		StringBuffer sb = new StringBuffer();
		int numCases = Integer.parseInt(br.readLine());
		for(int i=0; i<numCases; i++) {
			sb.append("Case #" + (i+1) + ": " + processCase(br.readLine()));
			if(i!=numCases-1) sb.append("\n");
		}
		pw.print(sb.toString());
		
		br.close();
		pw.close();
	}
	
	Set<Integer> visitedSet;
	
	private int processCase(String inputCase) {
		String[] s = inputCase.split(" ");
		int A = Integer.parseInt(s[0]);
		int B = Integer.parseInt(s[1]);
		visitedSet = new HashSet<Integer>();
		int res = 0;
		
		for(int i=A; i<=B; i++) {
			if(!visitedSet.contains(i))
				res+= process(i, A, B);
		}
		return res;
	}
	
	private int process(final int n, final int A, final int B) {
		String s = Integer.toString(n);
		int count=0;
		
		for(int i=s.length()-1; i>0; i--) {
			String s1 = s.substring(i) + s.substring(0, i);
			int num = Integer.parseInt(s1);
			visitedSet.add(num);
			if(num!=n && num>=A && num<=B) { if(num<n) System.out.println(num + ", " + n); else System.out.println(n + ", " + num); count++; }
		}
		visitedSet.add(n);
		return (count==0) ? 0 : (count+1)*(count)/2;
	}
}

class Main3 {
	public static void main(String args[]) throws NumberFormatException, IOException {
		RecycledNumbers r = new RecycledNumbers("C-small-attempt0.in.txt");
		r.processInput();
	}
}