import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

package com.techy.rajeev;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class Recycled {
	public static int[] toIntArray(String line){
		String[] p = line.trim().split("\\s+");
		int[] out = new int[p.length];
		for(int i=0;i<out.length;i++) out[i] = Integer.valueOf(p[i]);
		return out;
	}
	public static void main(String[] args) throws Exception, IOException {
		BufferedReader br = new BufferedReader(new FileReader("techyrajeev.txt"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("myoutput.out"));
		int num=Integer.valueOf(br.readLine().trim());
		int k=1,count=0;
		while(num>0){
			int arr[]=toIntArray(br.readLine());
			int x=arr[0];
			int y=arr[1];
			String past="";
			for(int i=x;i<=y;i++){
				String temp=i+"";
				for(int j=temp.length()-1,m=1;j>0;j--,m++){
				String test=temp.substring(m)+temp.substring(0,m);
				if(test.equals(past)){
					break;
				}
				int lk=Integer.parseInt(test);
				if(lk>i&&lk<=y){
					count++;
					past=test;
				}
				}
			}
			bw.write("Case #"+k+": "+count);
			bw.newLine();
			count=0;
			num--;
			k++;
		}
		br.close();
		bw.close();
		
	}

}
