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

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class RecycledNumbers {

	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new InputStreamReader(
					System.in));
			String str = "";

			// Testcases
			str = in.readLine();
			int cases = Integer.valueOf(str);
			List<String> output = new ArrayList<String>();

			CalculatorThread[] threads = new CalculatorThread[cases];

			long start = System.nanoTime();

			for (int i = 0; i < cases; i++) {

				str = in.readLine();

				String[] numbers = str.split(" ");

				int a = Integer.valueOf(numbers[0]);
				int b = Integer.valueOf(numbers[1]);

				CalculatorThread t = new CalculatorThread(a, b);
				t.start();
				threads[i] = t;
				
				if((i + 1) % 4 == 0) {
					try {
						t.join();
					} catch (InterruptedException e) {
						// TODO Auto-generated catch block
						e.printStackTrace();
					}
				}

			}

			System.out.println("waiting for threads");
			
			for (CalculatorThread t : threads) {
				
				try {
					t.join();
				} catch (InterruptedException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}

			}

			for (int i = 0; i < threads.length; i++) {
				output.add("Case #" + (i + 1) + ": " + threads[i].getSolution());
			}

			long end = System.nanoTime();
			float duration = ((float) end - start) / 1000 / 1000 / 1000;
			System.out.println("Duration: " + duration);

			for (String outputLine : output) {
				System.out.println(outputLine);
			}

		} catch (IOException e) {
		}
	}

}
