#pragma GCC optimize ( "O3" )
#pragma GCC optimize( "unroll-loops" )
#pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" )
#include <bits/stdc++.h>
using namespace std;

#define TYPE_OF( VAR ) remove_const<remove_reference<decltype( VAR )>::type >::type
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr )
#define CEXPR( LL , BOUND , VALUE ) constexpr LL BOUND = VALUE
#define GETLINE( A ) string A; getline( cin , A )
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ )
#define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ )
#define QUIT return 0

inline CEXPR( int , N , 60 );
void search( string ( &S )[N] , int i0 , int j0 , int i1 , int j1 )
{
  list<list<pair<int,int> > > path{};
  path.push_back( list<pair<int,int> >() );
  path.front().push_back( pair<int,int>( i0 , j0 ) );
  string d[4] = { "U" , "R" , "D" , "L" };
  int di[4] = { -1 , 0 , 1 , 0 };
  int dj[4] = { 0 , 1 , 0 , -1 };
  string w = "#";
  string e = "E";
  bool reach[N][N] = {};
  pair<int,int> c{};
  int& i = c.first;
  int& j = c.second;
  list<int> direction{};
  bool found = false;
  while( !found ){
    list<pair<int,int> >& last = path.back();
    list<pair<int,int> > next{};
    FOR_ITR( last , itr , end ){
      FOR( n , 0 , 4 ){
	i = itr->first + di[n];
	j = itr->second + dj[n];
	if( i == i1 && j == j1 ){
	  direction.push_front( n );
	  i1 = itr->first;
	  j1 = itr->second;
	  path.pop_back();
	  found = true;
	  break;
	}
	if( 0 <= i && i < N && 0 <= j && j < N && ! reach[i][j] ){
	  string Sij = S[i].substr( j , 1 );
	  if( Sij != w && Sij != e ){
	    reach[i][j] = true;
	    next.push_back( c );
	  }
	}
      }
      if( found ){
	break;
      }
    }
    if( !found ){
      assert( ! next.empty() );
      path.push_back( next );
    }
  }
  while( ! path.empty() ){
    list<pair<int,int> >& last = path.back();
    found = false;
    FOR_ITR( last , itr , end ){
      FOR( n , 0 , 4 ){
	i = itr->first + di[n];
	j = itr->second + dj[n];
	if( i == i1 && j == j1 ){
	  direction.push_front( n );
	  i1 = itr->first;
	  j1 = itr->second;
	  path.pop_back();
	  found = true;
	  break;
	}
      }
      if( found ){
	break;
      }
    }
  }
  FOR_ITR( direction , itr , end ){
    cout << "M " <<  d[*itr] << "\n";
  }
  return;
}

int main()
{
  UNTIE;
  GETLINE( NDH );
  string S[N];
  string s = "S";
  string g = "G";
  string k = "K";
  int start[2];
  int goal[2];
  int key[2];
  FOR( i , 0 , N ){
    string& Si = S[i];
    getline( cin , Si );
    FOR( j , 0 , N ){
      string Sij = Si.substr( j , 1 );
      if( Sij == s ){
	start[0] = i;
	start[1] = j;
      } else if( Sij == g ){
	goal[0] = i;
	goal[1] = j;
      } else if( Sij == k ){
	key[0] = i;
	key[1] = j;
      }
    }
  }
  search( S , start[0] , start[1] , key[0] , key[1] );
  search( S , key[0] , key[1] , goal[0] , goal[1] );
  QUIT;
}