Problem: Example

Input

2 1
WE


Output

1 2

Solution (in CPP):

Solution:
#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(20);
}

#define int ll
void solve(){
	int w, h;
	cin >> w >> h;
	vector<string> inputs;
	REP(i, h) {
		string s;
		cin >> s;
		inputs.push_back(s);
	}
	int ans = 0;
	REP(i, h) {
		REP(q, w) {
			if (inputs[i][q] == 'W')ans++;
		}
	}
	int now = ans;
	int itr = 0;
	REP(q, w) {
		REP(i, h) {
			if (inputs[i][q] == 'W') ans--;
			if (inputs[i][q] == 'E') ans++;
		}
		if (ans < now) {
			now = ans;
			itr = q + 1;
		}
	}
	cout << itr << " " << itr + 1 << endl;
}

#undef int
int main() {
	init();
	solve();
}