Problem: Example

Input

2 1
WE


Output

1 2

Solution (in CPP):

Solution:
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef complex<double> xy_t;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-11;

int main() {
    int n, m;
    cin >> n >> m;
    int a[n][2];
    for (int i = 0; i < n; i++) {
        fill(a[i], a[i] + 2, 0);
    }
    int sum = 0;
    for (int i = 0; i < m; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < n; j++) {
            if (s[j] == 'W') {
                a[j][0]++;
                sum++;
            } else {
                a[j][1]++;
            }
        }
    }
    int maxer = sum;
    int ans = -1;
    for (int i = 0; i < n; i++) {
        sum += a[i][1] - a[i][0];
        if (sum < maxer) {
            maxer = sum;
            ans = i;
        }
    }
    cout << ans + 1 << " " << ans + 2 << endl;
}