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;
	}
}



import java.io.*;
import java.lang.*;
import java.math.*;
public class problem {
    public BufferedWriter outf;
    public BufferedWriter outft;
    DataInputStream bs;
   public problem(){
try{
            File in = new File("in.txt");
            outf = new BufferedWriter(new FileWriter("out.txt", true));
            outft = new BufferedWriter(new FileWriter("out1.txt", true));
            bs = new DataInputStream(new FileInputStream(in));

       }
catch(IOException e){}

   }
    void stack()
    {
        try{int ret=0;
            int a=new Integer(bs.readLine());
            for(int i=0;i<a;i++)
            {
                    String line=bs.readLine();

                    act(line);
                    int qw=i+1;
                    String s= Integer.toString(cnt);
                        outf.write("Case #"+qw+": "+s);
                    outf.newLine();
                    outf.flush();
            }





        }
        catch(IOException e){}
        return;
    }char[] comb,opp;int count = 1;char[] combine;
    int cnt;
    void act(String line)
    {
     cnt = 0;
     String[] nums = new String[2];
     nums = line.split(" ");
     String t = new String(nums[0]);
     int num_size = t.length();
     int lower = new Integer(nums[0]);
     int upper = new Integer(nums[1]);
     
     for(int i = lower,k = 0;i < upper;k++,i++)
     {
        int[] res = span(i,num_size);
        
        for(int j = 0;j<res.length;j++)
        {
          if(res[j]>i && res[j]<=upper && res[j]>=lower)
          {try{
              String S = "Case #"+Integer.toString(k)+"  "+Integer.toString(i)+": "+Integer.toString(res[j]);
              outft.write(S);
              outft.newLine();
              outft.flush();
              cnt++;}
           catch(IOException r)
                  {
               
           }
            }
        }
        }
 }

    int[] span(int num,int num_size)
    { 
         int[] res = new int[num_size];

        String rec = Integer.toString(num);
        char[] previous = new char[rec.length()];
        rec.getChars(0,rec.length(), previous, 0);

        res [0] = new Integer(rec); //store 1st
        for(int j = 1; j < num_size; j++)
        {
            char first = previous[0];
            for(int i = 0;i<num_size-1;i++)
            {
               previous[i] = previous[i+1];
            }
            previous[num_size-1] = first;
            String u = new String(previous);
            res[j] = new Integer(u);
        }
        return res;
    }
public static void main(String[] args) {
        problem m = new problem();
m.stack();
    }
}
