#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 1e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define mod 998244853
#define bs 29
ll n,hsh[1000010],pw[1000010],st[100010],top=0,f[100010],cnt=0;
char s[1000010];
struct node{
	ll l,r,p;
}a[2000020];
il bl operator<(const node &x,const node &y){
	if(x.l!=y.l) return x.l<y.l;
	return x.r<y.r;
}
il ll get_hash(ll l,ll r){
	return (hsh[r]-pw[r-l+1]*hsh[l-1]%mod+mod)%mod;
}
il ll get_lcp(ll x,ll y){
	ll l=1,r=min(n-x+1,n-y+1);
	while(l<r){
		ll mid=(l+r+1)>>1;
		if(get_hash(x,x+mid-1)==get_hash(y,y+mid-1)) l=mid;
		else r=mid-1;
	}
	if(get_hash(x,x+l-1)==get_hash(y,y+l-1)) return l;
	else return l-1;
}
il ll get_lcs(ll x,ll y){
	ll l=1,r=min(x,y);
	while(l<r){
		ll mid=(l+r+1)>>1;
		if(get_hash(x-mid+1,x)==get_hash(y-mid+1,y)) l=mid;
		else r=mid-1;
	}
	if(get_hash(x-l+1,x)==get_hash(y-l+1,y)) return l;
	else return l-1;
}
int main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	fr(i,1,n) hsh[i]=(hsh[i-1]*bs+s[i]-'a'+1)%mod;
	pw[0]=1;
	fr(i,1,n) pw[i]=pw[i-1]*bs%mod;
	st[0]=n+1;
	pfr(i,n,1){
		while(top){
			ll tmp=get_lcp(i,st[top]);
			if(tmp<(n-st[top]+1)&&s[i+tmp]<s[st[top]+tmp]) top--;
			else break;
		}
		f[i]=st[top]-1;
		st[++top]=i;
	}
	fr(i,1,n){
		ll l=i,r=f[i];
		if(l>1) l-=get_lcs(i-1,f[i]);
		if(r<n) r+=get_lcp(i,f[i]+1);
		if((r-l+1)>=2*(f[i]-i+1)) a[++cnt]=(node){l,r,f[i]-i+1};
	}
	top=0;
	pfr(i,n,1){
		while(top){
			ll tmp=get_lcp(i,st[top]);
			if(tmp<(n-st[top]+1)&&s[i+tmp]>s[st[top]+tmp]) top--;
			else break;
		}
		f[i]=st[top]-1;
		st[++top]=i;
	}
	fr(i,1,n){
		ll l=i,r=f[i];
		if(l>1) l-=get_lcs(i-1,f[i]);
		if(r<n) r+=get_lcp(i,f[i]+1);
		if((r-l+1)>=2*(f[i]-i+1)) a[++cnt]=(node){l,r,f[i]-i+1};
	}
	sort(a+1,a+cnt+1);
	ll cntt=0;
	fr(i,1,cnt) if(!cntt||a[cntt]<a[i]) a[++cntt]=a[i];
	cnt=cntt;
	writeln(cnt);
	fr(i,1,cnt) pf("%lld %lld %lld\n",a[i].l,a[i].r,a[i].p); 
}