#include <bits/stdc++.h>
using namespace std;
#define ll long long
#pragma GCC optimize("O3,unroll-loops")
struct PolyHash{
    /*
    WARNING: make sure the values in the array or string are in the range [0,5e8]
    */
    vector<ll>powers;
    vector<ll>hashes;
    ll seed = 500002961;
    const ll mod = (ll)1e9+7;
    vector<int>arr;
    void init(int n){
        powers.resize(n+5); powers[0] = 1;
        hashes.resize(n+5);
        for(int i = 1; i<=n; i++){
            powers[i] = powers[i-1]*seed; powers[i]%=mod;
        }
        for(int i = 1; i<=n; i++){
            hashes[i] = hashes[i-1]*seed+arr[i]; hashes[i]%=mod;
        }
    }
    void init(int n, string s){//string is 0 indexed
        arr.resize(n+5);
        for(int i = 1; i<=n; i++){
            arr[i] = s[i-1];
        }
        init(n);
    }
    void init(int n, vector<int>a){//a is 1 indexed
        arr.resize(n+5);
        for(int i = 1; i<=n; i++){
            arr[i] = a[i];
        }
        init(n);
    }
    inline ll subhash(int l, int r){//inclusive
        ll hsh = hashes[r]-hashes[l-1]*powers[r-l+1]%mod; hsh+=mod; hsh%=mod;
        return hsh;
    }
};
vector<PolyHash>hsh(505);
inline bool eq(int i, int j, int l, int r) {
    return hsh[i].subhash(l,r) == hsh[j].subhash(l,r);
}
 vector<string>arr(505);
inline bool smaller(int i, int j, int l, int r)  {
    int low = l-1;
    int high = r+1;
    while(low + 1 < high){
        int mid = (low+high)/2;
        if(eq(i,j,l,mid)){
            low = mid;
        }
        else{
            high = mid;
        }
    }
    if(high == r+1)return false;
    return arr[i][high-1] < arr[j][high-1];
}
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
   
    for(int i = 1; i<=n; i++){
        cin >> arr[i];
    }
    
    vector<vector<int>>dp(n+1,vector<int>(m+2));
    for(int j = m; j>=1; j--){
        for(int i = 2; i<=n; i++){
            if(arr[i][j-1] != arr[i-1][j-1]){  
                continue;
            }
            else{
                dp[i][j] = dp[i][j+1]+1;
            }
        }
    }
   
    pair<int,int>p = {1,m};
    int mn = m-1;
    for(int j = 1; j<=m; j++){
        bool good = true;
        int mx = 0;
        for(int i = 2; i<=n; i++){
            int lcp = dp[i][j];
            if(j+lcp == m+1){
                good = false;
                break;
            }
            if(arr[i-1][j-1+lcp] > arr[i][j-1+lcp]){
                good = false;
                break;
            }
            mx = max(mx,lcp);
        }
        if(!good)continue;
       // cout << mx << '\n';
        if(mx < mn){
            mn = mx;
            p = {j,j+mx};
        }
       //cout << j << ' ' << high << '\n';
    }
    cout << p.first << ' ' << p.second << '\n';
    return 0;
}