package jp.funnything.competition.util;

import java.math.BigInteger;

/**
 * Utility for BigInteger
 */
public class BI {
    public static BigInteger ZERO = BigInteger.ZERO;
    public static BigInteger ONE = BigInteger.ONE;

    public static BigInteger add( final BigInteger x , final BigInteger y ) {
        return x.add( y );
    }

    public static BigInteger add( final BigInteger x , final long y ) {
        return add( x , v( y ) );
    }

    public static BigInteger add( final long x , final BigInteger y ) {
        return add( v( x ) , y );
    }

    public static int cmp( final BigInteger x , final BigInteger y ) {
        return x.compareTo( y );
    }

    public static int cmp( final BigInteger x , final long y ) {
        return cmp( x , v( y ) );
    }

    public static int cmp( final long x , final BigInteger y ) {
        return cmp( v( x ) , y );
    }

    public static BigInteger div( final BigInteger x , final BigInteger y ) {
        return x.divide( y );
    }

    public static BigInteger div( final BigInteger x , final long y ) {
        return div( x , v( y ) );
    }

    public static BigInteger div( final long x , final BigInteger y ) {
        return div( v( x ) , y );
    }

    public static BigInteger mod( final BigInteger x , final BigInteger y ) {
        return x.mod( y );
    }

    public static BigInteger mod( final BigInteger x , final long y ) {
        return mod( x , v( y ) );
    }

    public static BigInteger mod( final long x , final BigInteger y ) {
        return mod( v( x ) , y );
    }

    public static BigInteger mul( final BigInteger x , final BigInteger y ) {
        return x.multiply( y );
    }

    public static BigInteger mul( final BigInteger x , final long y ) {
        return mul( x , v( y ) );
    }

    public static BigInteger mul( final long x , final BigInteger y ) {
        return mul( v( x ) , y );
    }

    public static BigInteger sub( final BigInteger x , final BigInteger y ) {
        return x.subtract( y );
    }

    public static BigInteger sub( final BigInteger x , final long y ) {
        return sub( x , v( y ) );
    }

    public static BigInteger sub( final long x , final BigInteger y ) {
        return sub( v( x ) , y );
    }

    public static BigInteger v( final long value ) {
        return BigInteger.valueOf( value );
    }
}

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

class B
{
	public static void main(String[]args)
	{
		try
		{
			Scanner sc=new Scanner(new File("C-small-attempt0.in"));
			
			int count=sc.nextInt();
			String blank=sc.nextLine();
			
			PrintWriter pr=new PrintWriter(new FileWriter("BAnswer0.in"));
			
			for(int i=1; i<=count; i++)
			{
				int a=sc.nextInt();
				int b=sc.nextInt();
				
				int possible=0;
				
				for (int m=a; m<b; m++)
				{
					for(int n=m+1; n<=b; n++)
					{
						String strM=""+m;
						String strN=""+n;
						
						int lenM=strM.length();
						int lenN=strN.length();
						
						boolean test=false;
						
						if(m!=n&&m<n&&lenM==lenN)
						{
							String[]check=new String [lenM*lenM];
							int checkCount=0;
							
							for(int y=0; y<lenM; y++)//start pos
							{				
								String strTest="";//m arranged
								
								for(int z=y; z<y+lenM; z++)//new pos
								{
									int pos=z;
									
									while(pos>=lenM)
										pos-=lenM;
										
									strTest=strTest+strM.charAt(pos);
								}
								
								if(strTest.equals(strN))
								{
									boolean boolCheck=true;
									
									for(int c=0; c<checkCount; c++)
									{
										if(strTest.equals(check[c]))
											boolCheck=false;
									}
									
									if(boolCheck)
									{
										check[checkCount]=strTest;
										checkCount++;
										possible++;
									}
									
									
								}
								
							}
						}
					}
				}
				
				pr.println("Case #"+i+": "+possible);
			}
			
			pr.close();
		}
		catch (FileNotFoundException e)
		{
			System.out.println(e);
		}
		
		catch(IOException f)
		{
			System.out.println(f);
		}	
	}
	
	public static boolean checkRecycle(int m, int n)
	{
		String strM=""+m;
		String strN=""+n;
		
		int lenM=strM.length();
		int lenN=strN.length();
		
		boolean test=false;
		
		if(m!=n&&m<n&&lenM==lenN)
		{
			for(int y=0; y<lenM; y++)//start pos
			{				
				String strTest="";//m arranged
				
				for(int z=y; z<y+lenM; z++)
				{
					int pos=z;
					
					while(pos>=lenM)
						pos-=lenM;
						
					strTest=strTest+strM.charAt(pos);
				}
				
				if(strTest.equals(strN))
				{
					test= true;
				//	System.out.println(strTest+" "+strM+" "+strN);
				}
						else
							test= false;
				
			}
		}else
			test= false;
			
			return test;
	}
}