import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

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

public class AlienLanguage extends JamProblem {
    private int wordsC;
    private int wordsL;
    List<String> words = new ArrayList<String>();
    TreeNode startNode;

    public static void main(String[] args) throws IOException {
        AlienLanguage p = new AlienLanguage();
        p.go();
    }

    @Override
    void parseFirstLine(List<String> file) {
        int[] firstLine = JamUtil.parseIntList(file.get(0), 3);
        caseCount = firstLine[2];
        wordsC = firstLine[1];
        wordsL = firstLine[0];
        startNode = new TreeNode(null);
        for (int i=0; i<wordsC; i++) {
            String word = file.get(i + 1);
            words.add(word);
            buildTree(word, startNode);
        }
        lastLine = wordsC + 1;
    }

    @Override
    String solveCase(JamCase jamCase) {
        ALCase cas = (ALCase) jamCase;
        Set<TreeNode> curr = new HashSet<>();
        curr.add(startNode);
        List<Set<Character>> pattern = cas.pattern;
        for (int i = 0; i < pattern.size(); i++) {
            Set<Character> characters = pattern.get(i);
            Set<TreeNode> next = new HashSet<>();
            for (Character ch : characters) {
                for (TreeNode node : curr) {
                    if (node.childred.containsKey(ch)) {
                        next.add(node.childred.get(ch));
                    }
                }
            }
            curr = next;
        }
        return "" + curr.size();
    }

    @Override
    JamCase parseCase(List<String> file, int lineI) {
        ALCase cas = new ALCase();
        cas.lineCount = 1;
        String line = file.get(lineI);
        boolean inGroup = false;
        char[] chars = line.toCharArray();
        Set<Character> current = new HashSet<>();
        for (int i = 0; i < chars.length; i++) {
            char ch = chars[i];
            switch (ch) {
                case '(':
                    inGroup = true;
                    current = new HashSet<>();
                    cas.pattern.add(current);
                    break;
                case ')':
                    inGroup = false;
                    break;
                default:
                    if (inGroup) {
                        current.add(ch);
                    } else {
                        current = new HashSet<>();
                        cas.pattern.add(current);
                        current.add(ch);
                    }
            }
        }
        return cas;
    }

    void buildTree(String str, TreeNode node) {
        char c = str.charAt(0);
        String remain = str.substring(1);
        if (node.childred.get(c) == null) {
            TreeNode newNode = new TreeNode(c);
            node.childred.put(c,newNode);
        }
        if (!remain.isEmpty()) {
            buildTree(remain,node.childred.get(c));
        }
    }
}

class ALCase extends JamCase {
    TreeNode startNode = new TreeNode(null);
    List<Set<Character>> pattern = new ArrayList<Set<Character>>();
}

class TreeNode {
    TreeNode(Character ch) {
        this.ch = ch;
    }

    Character ch;
    Map<Character,TreeNode> childred = new HashMap<Character, TreeNode>();
}


