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

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;



public class CRecycledNumbers {
	
	static int recycle(int a, int b) {
		System.out.println("-------------------------");
		System.out.println(a + " " + b);
		int count = 0;
		Set<String> used = new HashSet<String>();
		for(int i = a; i < b; ++i) {
			String s = Integer.toString(i);
			for(int j = 1; j < s.length(); ++j) {
				String pre = s.substring(0, j);
				String suf = s.substring(j);
				if(suf.startsWith("0")) continue;
				int c = Integer.parseInt(suf + pre);
				if(c <= b && c != i && i < c) {
					String p = i < c? (i + "-" + c) : (c + "-" + i);
					if(!used.contains(p)) {
						used.add(p);
						System.out.println(p);
						++count;
					}
				}
			}
			
		}
		
		return count;
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		String filename = "C-small-attempt0.in";
		BufferedReader r = new BufferedReader(new FileReader(filename));
		int n = Integer.parseInt(r.readLine());
		PrintWriter p = new PrintWriter("c.out");
		for(int i = 0; i < n; ++i) {
			String[] test = r.readLine().split(" ");
			int j = i + 1;
			p.println("Case #" + j + ": " +  recycle(Integer.parseInt(test[0]), Integer.parseInt(test[1])));
			
		}
		p.flush();
		p.close();
	}

}
