/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj;

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;


public class RecycledNumbers {
	
	public static void main(final String[] args) throws IOException {
		if (args.length == 0) {
			System.out.println("Input file must be provided as an input");
			return;
		}
		PrintWriter pw = null;
		try {
			pw = new PrintWriter(new BufferedWriter(new FileWriter(args[1])));
			
			List<TestCase> cases = parseInput(args[0]);
			for (final TestCase testCase : cases) {
				pw.println("Case #" + testCase.getCaseNumber() + ": " + testCase.solve());			
			}
			
		} finally {
			if(pw != null) {
				pw.close();
			}
		}
	}
	
	private static List<TestCase> parseInput(final String filename) throws IOException {
		final List<TestCase> res = new ArrayList<TestCase>();
		BufferedReader br = null;
		try {
			br = new BufferedReader(new FileReader(filename));
			int casesNum = Integer.parseInt(br.readLine());
			for (int i = 1; i <= casesNum; ++i) {
				String[] args = br.readLine().split("\\s");
				res.add(new TestCase(i, Integer.parseInt(args[0]), Integer.parseInt(args[1])));
			}
		} finally {
			if (br != null) {
				br.close();
			}
		}
		return res;
	}
	
	private static class TestCase {
		private final int caseNumber;
		private final int a;
		private final int b;
		
		public TestCase(int caseNumber, int a, int b) {
			super();
			this.caseNumber = caseNumber;
			this.a = a;
			this.b = b;
		}

		public int solve() {
			int res = 0;
			for(int i = a; i < b; ++i) {
				for(int j = i + 1; j <=b; ++j) {
					final String iStr = ("" + i) + i;
					final String jStr = "" + j;
					if (iStr.contains(jStr)) {
						++res;
					}
				}
			}
			return res;
		}

		public int getCaseNumber() {
			return caseNumber;
		}
	}
}
