Problem: Example

Input

2 1
WE


Output

1 2

Solution (in CPP):

Solution:

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}


int main(void) {
    int i,j;
    int n,m;
    cin >> n >> m;
    vector<vi> v(n,vi(2,0));
    rep(i,m){
        string s;
        cin >> s;
        rep(j,n)v[j][s[j] == 'E']++;
    }
    rep(i,n-1)v[i+1][0] += v[i][0], v[i+1][1] += v[i][1];

    int ans = 0, sum = v[n-1][0];
    loop(i,1,n){
        int t = v[i-1][1] + (v[n-1][0]-v[i-1][0]);
        if(t < sum)ans = i, sum = t;
    }
    if(v[n-1][1] < sum)ans = n, sum = v[n-1][1];
    cout << ans << " " << ans+1 << endl;
}