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.util.HashSet;
import java.util.Scanner;

public class Main
{
	public static void main(String[] args)
	{
		Scanner oku = new Scanner(System.in);

		int test = oku.nextInt(), A = oku.nextInt(), B = oku.nextInt(), dijit = Integer.toString(A).length(), sayimiz = 0;

		HashSet<Integer> eleme;

		for (int i = 0; i < test; i++, A = oku.nextInt(), B = oku.nextInt(), sayimiz = 0)
		{
			dijit = Integer.toString(A).length();
			
			for (int j = A; j < B; j++)
			{
				eleme = new HashSet<Integer>();
				
				for (int k = 1; k < dijit; k++)
				{
					int saga_kayan = j / (int) Math.pow(10, k);
					int sola_kayan = (j % (int) Math.pow(10, k) * (int) Math.pow(10, dijit - k));
					int son = saga_kayan + sola_kayan;
					
					if (son <= B && j < son)
					{
						eleme.add(son);
					}
				}

				sayimiz += eleme.size();
			}

			System.out.println("Case #" + (i + 1) + ": " + sayimiz);
		}
	}
}