import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.util.*;

public class Recycled {
    public static void main(String[] args) throws Exception {


        Scanner s = new Scanner(System.in);
        int T = Integer.parseInt(s.nextLine());
        for (int t = 0; t < T; t++) {
            int A = s.nextInt();
            int B = s.nextInt();
            long[] values = new long[B + 1];

            Set<Pair> set = new HashSet<Pair>();

            for (int i = A; i <= B; i++) {
                String istr = "" + i;
                for (int j = 1; j < istr.length(); j++) {
                    String prefix = istr.substring(istr.length() - j, istr.length());
                    String suffix = istr.substring(0, istr.length() - j);
//                    Set<Integer> set = new HashSet<Integer>();
                    if (prefix.charAt(0) != '0') {
                        String newNumber = prefix + suffix;
                        int newNumberInt = Integer.parseInt(newNumber);
//                        System.out.println(newNumberInt);
                        if (newNumberInt > i && newNumberInt <= B
                                && String.valueOf(i).length() == String.valueOf(newNumberInt).length()) {
//                            if (set.contains(newNumberInt))
//                                System.out.println(newNumberInt);
//                            set.add(newNumberInt);
                            values[newNumberInt] += 1;
                            Pair p = new Pair(i, newNumberInt);
                            set.add(p);
//                            System.out.println("(" + i + ", " + newNumberInt + ")");
                        }
                    }
                }
            }

            long sum = 0;
            for (int i = A; i <= B; i++) {
                sum += values[i];
            }
            System.out.println("Case #" + (t + 1) + ": " + set.size());
        }
    }
}

class Pair {

    int n;
    int m;

    public Pair(int n, int m) throws Exception {
        if (n >= m)
            throw new Exception();

        this.n = n;
        this.m = m;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        Pair pair = (Pair) o;

        if (m != pair.m) return false;
        if (n != pair.n) return false;

        return true;
    }

    @Override
    public int hashCode() {
        int result = n;
        result = 31 * result + m;
        return result;
    }
}