#include "iostream"
#include "algorithm"
#include "cstring"
#include "cstdio"
#include "cmath"
#include "vector"
#include "map"
#include "set"
#include "queue"
using namespace std;
#define MAXN 200006
//#define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define all(x) (x).begin() , (x).end()
#define mem( a ) memset( a , 0 , sizeof a )
typedef long long ll;
int n , m;
int A[MAXN];

int W[MAXN] , E[MAXN];
char ch[MAXN];

void solve() {
	cin >> n >> m;
	rep( i , 1 , m ) {
		scanf("%s",ch + 1);
		rep( j , 1 , n ) W[j] += ( ch[j] == 'W' ) , E[j] += ( ch[j] == 'E' );
	}
	rep( i , 1 , n ) E[i] += E[i - 1];
	per( i , n + 1 , 1 ) W[i] += W[i + 1];
	int mn = 0x3f3f3f3f , ps = 0;
	rep( i , 0 , n ) {
		if( E[i] + W[i + 1] < mn ) 
			mn = E[i] + W[i + 1] , ps = i;
	}
	printf("%d %d\n",ps,ps + 1);
}

signed main() {
//    int T;cin >> T;while( T-- ) solve();
    solve();
}