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.Scanner;


public class C {

	public static class N
	{
		public static int[] m_num;
		public static int m_first;
		public static int length;
		
		public static void set(int n)
		{
			String s = Integer.toString(n);
			char[] c = s.toCharArray();
			m_num = new int[c.length];
			m_first = 0;
			for(int i = 0; i < c.length; i++)
			{
				m_num[m_num.length - i - 1] = Character.digit(c[i], 10);
			}
			length = m_num.length;
		}
		
		
		public static int nextNum()
		{
			m_first = (m_first + 1) % m_num.length;
			int ret = 0;
			int mult = 1;
			for(int i = 0; i < m_num.length; i++)
			{
				ret += (mult*m_num[(i+m_first)%m_num.length]);
				mult *= 10;
			}
			return ret;
		}
		
	}
	
	
	public static int[] binom = {0, 0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105};
	
	public static void main(String[] args)
	{
	
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt();
		
		for(int t = 1; t <= T; t++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			System.out.println("Case #" + t + ": " + foo(A, B));
		}
	}
	
	public static int foo(int lower, int upper)
	{
		if(upper < 10) return 0;
		
		int counter = 0;
		
		boolean[] checked = new boolean[upper - lower + 1];
		
		for(int i = lower; i <= upper; i++)
		{
			if(checked[i-lower]) continue;
			
			N.set(i);
			
			int items = 0;
			
			for(int j = 0; j < N.length; j++)
			{
				int num = N.nextNum();
				
				if(num < lower || num > upper || checked[num-lower]) continue;
				
				checked[num-lower] = true;
				
				items++;
			}
			
			counter += binom[items];
		}
		
		return counter;
	}
}
