import java.io.*;
import java.util.*;

public class C {

    void solve() throws IOException {
        in("C-large.in"); out("C-large.out");

        long tm = System.currentTimeMillis();
        boolean[] mask = new boolean[2000000];
        int[] r = new int[10];
        int t = readInt();
        for (int cs = 1; cs <= t; ++cs) {
            int a = readInt();
            int b = readInt();
            int ans = 0;
            for (int m = a + 1; m <= b; ++m) {
                char[] d = String.valueOf(m).toCharArray();
                int c = 0;
                for (int i = 1; i < d.length; ++i) {
                    if (d[i] != '0' && d[i] <= d[0]) {
                        int n = 0;
                        for (int j = 0; j < d.length; ++j) {
                            int jj = i + j;
                            if (jj >= d.length) jj -= d.length;
                            n = n * 10 + (d[jj] - '0');
                        }
                        if (n >= a && n < m && !mask[n]) {
                            ++ans;
                            mask[n] = true;
                            r[c++] = n;
                        }
                    }
                }
                for (int i = 0; i < c; ++i) {
                    mask[r[i]] = false;
                }
            }
            println("Case #" + cs + ": " + ans);
            //System.out.println(cs);
        }
        System.out.println("time: " + (System.currentTimeMillis() - tm));
        exit();
    }

    void in(String name) throws IOException {
        if (name.equals("__std")) {
            in = new BufferedReader(new InputStreamReader(System.in));
        } else {
            in = new BufferedReader(new FileReader(name));
        }
    }

    void out(String name) throws IOException {
        if (name.equals("__std")) {
            out = new PrintWriter(System.out);
        } else {
            out = new PrintWriter(name);
        }
    }

    void exit() {
        out.close();
        System.exit(0);
    }

    int readInt() throws IOException {
        return Integer.parseInt(readToken());
    }

    long readLong() throws IOException {
        return Long.parseLong(readToken());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readToken());
    }

    String readLine() throws IOException {
        st = null;
        return in.readLine();
    }

    String readToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }

    boolean eof() throws IOException {
        return !in.ready();
    }

    void print(String format, Object ... args) {
        out.println(new Formatter(Locale.US).format(format, args));
    }

    void println(String format, Object ... args) {
        out.println(new Formatter(Locale.US).format(format, args));
    }

    void print(Object value) {
        out.print(value);
    }

    void println(Object value) {
        out.println(value);
    }

    void println() {
        out.println();
    }

    StringTokenizer st;

    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws IOException {
        new C().solve();
    }
}

package com.google;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.text.MessageFormat;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class Recycle {
    public static class Pair {
        long a;
        long b;
        
        public Pair(long a, long b) {
            this.a = a;
            this.b = b;
        }

        @Override
        public int hashCode() {
            final int prime = 31;
            int result = 1;
            result = prime * result + (int) (a ^ (a >>> 32));
            result = prime * result + (int) (b ^ (b >>> 32));
            return result;
        }

        @Override
        public boolean equals(Object obj) {
            if (this == obj)
                return true;
            if (obj == null)
                return false;
            if (getClass() != obj.getClass())
                return false;
            Pair other = (Pair) obj;
            if (a != other.a)
                return false;
            if (b != other.b)
                return false;
            return true;
        }
    }
    
    public static void main(String[] args) throws IOException {
        final Scanner reader = new Scanner(new File("in.txt"));
        final FileWriter writer = new FileWriter(new File("out.txt"));
        
        final int N = reader.nextInt();
        reader.nextLine();
        
        for (int i = 0; i < N; i++) {
            final long min = reader.nextLong();
            final long max = reader.nextLong();
            writer.write(String.format("Case #%d: %d", (i + 1), findCount(min, max)));
            if (i < N - 1) {
                writer.write("\n");
            }
        }
        
        writer.close();
    }

    public static int findCount(final long min, final long max) {
        Set<Pair> allPairs = new HashSet<Pair>();
        int resCount = 0;
        for (long i = min; i <= max; i++) {
            int [] num = numToArr(i);

            for (int j = 0; j < num.length - 1; j++) {
                num = shift(num);
                final Pair p = new Pair(i, fromArrToNum(num));
                if (isValid(num, i, max) && !allPairs.contains(p)) {
                    resCount++;
                    allPairs.add(p);
                }
            }
        }
        
        return resCount;
    }
    
    public static int [] shift(int [] num) {
        final int [] res = new int [num.length];
        res[0] = num[num.length - 1];

        for (int i = 1; i < res.length; i++) {
            res[i] = num[i - 1];
        }

        return res;
    }

    public static long fromArrToNum(int [] arr) {
        long a = 0;
        for (int i : arr) {
            a = a + i;
            a = a * 10;
        }

        a = a / 10;
        
        return a;
    }
    
    public static boolean isValid(int [] num, long base, long max) {
        if (num[0] == 0) return false;

        long a = fromArrToNum(num);

        return base < a && a <= max;
    }

    public static boolean consistOfUniqueDigits(int [] num) {
        final boolean [] arr = new boolean [10];

        for (int i : num) {
            if (arr[i]) return false;
            arr[i] = true;
        }

        return true;
    }

    public static int [] numToArr(final long in) {
        final List<Integer> list = new ArrayList<Integer>();
        long a = in;

        while (a > 0) {
            list.add((int) (a % 10));
            a = a / 10;
        }

        final int [] res = new int [list.size()];
        for (int i = 0; i < list.size(); i++) {
            res[res.length - i -1] = list.get(i);
        }

        return res;
    } 
}
