import java.io.*;
import java.util.*;
import java.awt.geom.*;

/**
 * Solution to Egg Drop
 * 
 * @author vanb
 */
public class eggdrop_vanb
{
    public Scanner sc;
    public PrintStream ps;
        
    /**
     * Driver.
     * @throws Exception
     */
    public void doit() throws Exception
    {
        sc = new Scanner( System.in );
        ps = System.out;
        
        int n = sc.nextInt();
        int k = sc.nextInt();
        
        // We're guaranteed that the egg will break when
        // dropped from floor k. So, without any other info,
        // the highest floor it could possible be safe on
        // is k-1
        int hisafe = k-1;
        
        // Likewise, we know it's always safe on floor 1, 
        // so the lowest floor it could possibly break on is 2.
        int lobreak = 2;
        
        for( int i=0; i<n; i++ )
        {
            int floor = sc.nextInt();
            String result = sc.next();
            if( result.equals( "SAFE" ) )
            {
                // If the egg is safe on this floor,
                // then the lowest floor it could possibly
                // break on is the floor above this one.
                lobreak = Math.max( lobreak, floor+1 );
            }
            else
            {
                // If the egg breaks on this floor, 
                // then the highest floor it could possibly
                // be safe on is the floor below this one.
                hisafe = Math.min( hisafe, floor-1 );
            }
        }
        
        ps.println( lobreak + " " + hisafe );
    }
    
    /**
     * @param args
     */
    public static void main( String[] args ) throws Exception
    {
        new eggdrop_vanb().doit();        
    }   
}