import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

package qualification;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Recycled {
	public static void main(String[] args) throws FileNotFoundException {
		List<Pair> list = new ArrayList<Pair>();
		Scanner s = new Scanner(new File("C-small-attempt1.in"));
		s.nextLine();

		int count = 1;
		while (s.hasNext()) {
			int a = s.nextInt();
			int b = s.nextInt();
			int result = 0;
			list.clear();

			for (int i = a; i < b; i++) {
				String as = i + "";

				int l = as.length();
				for (int j = 1; j < as.length(); j++) {
					String back = as.substring(l - j, l);
					String front = as.substring(0, l - j);
					String ts = back + front;

					if (back.charAt(0) == '0' || as.length() != ts.length() || as.equals(ts))
						continue;
					int tsInt = Integer.parseInt(ts);
					
					if (tsInt <= b && i <= tsInt){
						boolean hasPair = false;
						for(int k=0; k<list.size(); k++){
							Pair p = list.get(k);
							if(p.a.equals(String.valueOf(i)) && p.b.equals(ts)){
								hasPair = true;
								break;
							}
						}
						if(!hasPair){
							list.add(new Pair(i+"", ts));
							result++;
						}
					}

				}
			}

			System.out.print("Case #" + count + ": " + result);

			if (s.hasNext()) {
				count++;
				System.out.println();
			}
		}
	}
}

class Pair{
	String a;
	String b;

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