#include <bits/stdc++.h>
#define pii pair <int, int> 
#define tup pair <pii, int>
using namespace std;
void write(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
mt19937 rnd(time(0));
int n,q;
char s[1000006];
int nxt[1000006],stk[1000006],top;
const int base1=19491001,mod1=1019260817;
const int base2=131,mod2=1000000007;
int hsh1[1000006],pw1[1000006];
int hsh2[1000006],pw2[1000006];
inline void inithsh(void) {
    static int val[128]; pw1[0]=pw2[0]=1;
    for(int i=0; i<128; ++i) val[i]=i*i;
    for(int i=1; i<=n; ++i) hsh1[i]=(1ll*hsh1[i-1]*base1+val[s[i]])%mod1;
    for(int i=1; i<=n; ++i) pw1[i]=1ll*pw1[i-1]*base1%mod1;
    for(int i=1; i<=n; ++i) hsh2[i]=(1ll*hsh2[i-1]*base2+val[s[i]])%mod2;
    for(int i=1; i<=n; ++i) pw2[i]=1ll*pw2[i-1]*base2%mod2;
}
inline int gethsh1(int l,int k) { return (hsh1[l+k]-1ll*hsh1[l]*pw1[k])%mod1; }  // l'=l-1
inline int gethsh2(int l,int k) { return (hsh2[l+k]-1ll*hsh2[l]*pw2[k])%mod2; }  // l'=l-1
inline int getHSH1(int r,int k) { return (hsh1[r]-1ll*hsh1[r-k]*pw1[k])%mod1; }  // reversed 
inline int getHSH2(int r,int k) { return (hsh2[r]-1ll*hsh2[r-k]*pw2[k])%mod2; }  // reversed
inline bool checklcp(int x,int y,int lcp) { return (gethsh1(x,lcp)-gethsh1(y,lcp))%mod1==0&&(gethsh2(x,lcp)-gethsh2(y,lcp))%mod2==0; }
inline bool checklcs(int x,int y,int lcs) { return (getHSH1(x,lcs)-getHSH1(y,lcs))%mod1==0&&(getHSH2(x,lcs)-getHSH2(y,lcs))%mod2==0; }
inline int lcp(int x,int y) {  // return length 
    --x,--y;  // mark
    int res=0,d=1,lim=n-max(x,y);
    while(res+d<=lim&&checklcp(x,y,res+d)) res+=d,d<<=1;
    for(d>>=1; d; d>>=1) (res+d<=lim) && checklcp(x,y,res+d) && (res+=d);
    return res;
}
inline int lcs(int x,int y) {  // return length 
    int res=0,d=1,lim=min(x,y);
    while(res+d<=lim&&checklcs(x,y,res+d)) res+=d,d<<=1;
    for(d>>=1; d; d>>=1) (res+d<=lim) && checklcs(x,y,res+d) && (res+=d);
    return res;
}
inline bool cmp(int x,int y) { int l=lcp(x,y); return s[x+l]<s[y+l]; }  // compare suffix
inline void findnxt(int o) {
    for(int i=1; i<=n; ++i) {
        while(top && cmp(i,stk[top])==o) nxt[stk[top--]]=i;
        stk[++top]=i;
    }
    while(top) nxt[stk[top--]]=n+1;
}
vector <tup> run;
inline void check(int x,int y) {  // lyndon root
    int l=x-lcs(x,y)+1,r=y+lcp(x,y)-1;
	if(r-l+1<((y-x)<<1)) return ;
	run.push_back(make_pair(make_pair(l,r),y-x));
}
signed main() {
    // freopen("localinput","r",stdin);
    // freopen("localoutput","w",stdout);
    // scanf("%d%d%s",&n,&q,s+1); 
    scanf("%s",s+1); n=strlen(s+1); inithsh();
    findnxt(0); for(int i=1; i<=n; ++i) if(nxt[i]<=n) check(i,nxt[i]);
    findnxt(1); for(int i=1; i<=n; ++i) if(nxt[i]<=n) check(i,nxt[i]);
    sort(run.begin(),run.end());
	run.erase(unique(run.begin(),run.end()),run.end());
	write(run.size()); puts("");
	for(tup x : run) write(x.first.first),putchar(' '),write(x.first.second),putchar(' '),write(x.second),puts("");	
    // fprintf(stderr,"%.4lf\n",1.0*clock()/CLOCKS_PER_SEC);
    return 0;
}