Problem: Example

Input

2 1
WE


Output

1 2

Solution (in CPP):

Solution:
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

void solve() {
    int W, H; cin >> W >> H;
    vector<string> vs(H); for (int i = 0; i < H; i++) cin >> vs[i];
    int se = 0, sw = 0;
    for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) {
        sw += (vs[i][j] == 'W');
    }
    int idx = 0;
    int res = sw;
    for (int i = 0; i < W; i++) {
        for (int j = 0; j < H; j++) {
            if (vs[j][i] == 'E') {
                se++;
            }
            else {
                sw--;
            }
        }
        if (chmin(res, se + sw)) {
            idx = i + 1;
        }
    }
    printf("%d %d\n", idx, idx + 1);
}

int main()
{
    
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    

	int kkt = 1;
	while (kkt--) {
		solve();
	}
    return 0;
}