#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define se second
#define lowbit(x) x&(-x)
#define pll pair<int,int>
typedef long long ll;
//typedef unsigned long long ull;
const int N=1e6+10,M=1e6,mod=998244353;
int n,m,k;
int num[N];
int res;

string s;
int ne[N],len=0,j=0;

void ini(char c)
{
    s="x";
    s+=c;
    len=1;
    j=0;
    ne[1]=0;
}

void add(char c)
{
    s+=c;
    len++;
    while(j&&s[j+1]!=s[len]) j=ne[j];
    if(s[j+1]==s[len]) 
    {
        //cout<<s<<" "<<s[j+1]<<" "<<s[len]<<endl;
        j++;
    }
    ne[len]=j;
}

void to(int l)
{
    len=l;
    j=ne[l];
}

void solve()
{
    string s;
    cin>>s;
    n=s.size();
    s='a'+s;
    ini(s[1]);
    int L=1;
    //for(int j=1;j<=len;j++) cout<<ne[j]<<" ";cout<<endl;
    cout<<"1 1"<<"\n";
    for(int i=2;i<=n;i++)
    {
        if(s[i]>s[L]) L=i,ini(s[i]);
        else
        {
            int idx=-1;
            int p=len;
            while(p>1)
            {
                if(s[L+ne[p]]<s[i]) idx=ne[p];
                p=ne[p];
            }
            if(idx!=-1) L=i-p,to(p);
            add(s[i]);
        }
        cout<<L<<" "<<i<<"\n";
        //for(int j=1;j<=len;j++) cout<<ne[j]<<" ";cout<<endl;
    }
}

signed main()
{
    //ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T;
    T=1;
    //cin>>T;
    while(T--) solve();
    return 0;
}