#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 2e4 + 5;
const int M = 5e2 + 5;
int n, l, k[M][N];
string s[N];
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> l;
    for(int i = 0;i < n;i++)
		cin >> s[i];
	for(int i = 1;i < n;i++) {
		for(int j = 0;j < l;j++) {
			int x = j;
			while(x < l && s[i - 1][x] == s[i][x])
				x++;
			bool smaller = (s[i - 1][x] < s[i][x]);
			for(int p = 0;p < min(l, x);p++)
				k[i - 1][p] = x;
			for(int p = x;p < l;p++) {
				if(smaller == (s[i - 1][p] < s[i][p]))
					k[i - 1][p] = p;
				else {
					int np = p;
					while(np < l && s[i - 1][np] == s[i][np])
						np++;
					if(np == l) {
						for(int pp = p;pp < np;pp++)
							k[i - 1][pp] = 2e9;
						break;
					} else {
						if((s[i - 1][np] < s[i][np]) == smaller) {
							for(int pp = p;pp <= np;pp++)
								k[i - 1][pp] = np;
						} else {
							for(int pp = p;pp <= np;pp++)
								k[i - 1][pp] = 2e9;
						}
						p = np;
					}
				}
			}
			break;
		}
	}
	int mn = 1e9, x, y;
	for(int i = 0;i < l;i++) {
		int mx = 0;
		for(int j = 0;j + 1 < n;j++)
			mx = max(mx, k[j][i]);
		if(mx - i < mn)
			mn = mx - i, x = i, y = mx;
	}
	cout << x + 1 << " " << y + 1;
    return 0;
}