#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 8e18
	#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 ull unsigned long long
#define bs 29
#define LC x<<1
#define RC x<<1|1
vector<ll> qry[1000010];
ll n,m,k,pre[1000010],prelst[1000010],suflst[1000010],ans[1000010];
ll fail[1000010],res=0,sum[1000010],failt[1000010];
ll tree[4000040],lz[4000040];
ull hsht[1000010],hshp[1000010],pw[1000010];
char s[1000010],t[1000010],p[1000010];
bl ck[1000010];
struct node{
	ll nxt,to;
};
struct Tree{
	ll head[1000010],cnt=0,st[1000010],ed[1000010],tot=-1;
	node e[1000010];
	void add(ll u,ll v){
		e[++cnt].nxt=head[u];
		e[cnt].to=v;
		head[u]=cnt;
	}
	void dfs1(ll u){
		st[u]=++tot;
		go(u){
			ll v=e[i].to;
			dfs1(v);
		}
		ed[u]=tot;
	}
}T1,T2;
il void pushup(ll x){
	tree[x]=tree[LC]+tree[RC];
}
il void pushdown(ll x,ll l,ll r){
	if(!lz[x]) return;
	ll mid=(l+r)>>1;
	tree[LC]+=(mid-l+1)*lz[x];
	tree[RC]+=(r-mid)*lz[x];
	lz[LC]+=lz[x];
	lz[RC]+=lz[x];
	lz[x]=0;
}
void mdf(ll x,ll l,ll r,ll ql,ll qr,ll v){
	if(ql<=l&&r<=qr){
		tree[x]+=(r-l+1)*v;
		lz[x]+=v;
		return;
	}
	ll mid=(l+r)>>1;
	pushdown(x,l,r);
	if(ql<=mid) mdf(LC,l,mid,ql,qr,v);
	if(mid<qr) mdf(RC,mid+1,r,ql,qr,v);
	pushup(x);
}
ll query(ll x,ll l,ll r,ll pos){
	if(l==r) return tree[x];
	ll mid=(l+r)>>1;
	pushdown(x,l,r);
	if(pos<=mid) return query(LC,l,mid,pos);
	else return query(RC,mid+1,r,pos);
}
void init(bl o=0){
	fr(i,2,k){
		ll now=fail[i-1];
		while(now&&p[now+1]!=p[i]) now=fail[now];
		if(p[now+1]==p[i]) fail[i]=now+1;
	}
	fr(i,2,m){
		ll now=failt[i-1];
		while(now&&t[now+1]!=t[i]) now=failt[now];
		if(t[now+1]==t[i]) failt[i]=now+1;
	}
	ll now=0;
	fr(i,1,k){
		while(now&&t[now+1]!=p[i]) now=failt[now];
		if(t[now+1]==p[i]) now++;
		if(now==m){
			if(i>m&&o) ck[i-m]=1;
			now=failt[now];
		}
	}
}
void dfs2(ll u){
	if(ck[u]&&(k-m-u)>=1) mdf(1,1,k,T2.st[k-m-u],T2.ed[k-m-u],1);
	fr(i,0,(ll)qry[u].size()-1){
		ll id=qry[u][i];
		ans[id]+=query(1,1,k,T2.st[suflst[id]]);
	}
	for(ll i=T1.head[u];i;i=T1.e[i].nxt){
		ll v=T1.e[i].to;
		dfs2(v);
	}
	if(ck[u]&&(k-m-u)>=1) mdf(1,1,k,T2.st[k-m-u],T2.ed[k-m-u],-1);
}
il ull gett(ll l,ll r){
	return hsht[r]-hsht[l-1]*pw[r-l+1];
}
il ull getp(ll l,ll r){
	return hshp[r]-hshp[l-1]*pw[r-l+1];
}
int main(){
	scanf("%s",s+1);
	scanf("%s",t+1);
	scanf("%s",p+1);
	n=strlen(s+1);
	m=strlen(t+1);
	k=strlen(p+1);
	init(1);
	fr(i,1,k) T1.add(fail[i],i);
	T1.dfs1(0);
	ll now=0;
	fr(i,1,n){
		pre[i]=pre[i-1];
		while(now&&p[now+1]!=s[i]) now=fail[now];
		if(p[now+1]==s[i]) now++;
		if(now==k){
			pre[i]++;
			now=fail[now];
		}
		prelst[i]=now;
	}
	now=0;
	fr(i,1,m){
		while(now&&p[now+1]!=t[i]) now=fail[now];
		if(p[now+1]==t[i]) now++;
		if(now==k){
			res++;
			now=fail[now];
		}
	}
	pw[0]=1;
	fr(i,1,1000000) pw[i]=pw[i-1]*bs;
	fr(i,1,m) hsht[i]=hsht[i-1]*bs+(t[i]-'a'+1);
	fr(i,1,k) hshp[i]=hshp[i-1]*bs+(p[i]-'a'+1);
	fr(i,1,min(m,k-1)) if(gett(1,i)==getp(k-i+1,k)) sum[k-i]++;
	fr(i,1,k) sum[i]+=sum[fail[i]];
	fr(i,0,n){
		ans[i]+=pre[i];
		if(prelst[i]) ans[i]+=sum[prelst[i]];
	}
	reverse(s+1,s+n+1);
	reverse(t+1,t+m+1);
	reverse(p+1,p+k+1);
	fr(i,1,k) fail[i]=sum[i]=0;
	fr(i,1,m) failt[i]=0;
	init();
	fr(i,1,k) T2.add(fail[i],i);
	T2.dfs1(0);
	now=0;
	fr(i,1,n){
		pre[i]=pre[i-1];
		while(now&&p[now+1]!=s[i]) now=fail[now];
		if(p[now+1]==s[i]) now++;
		if(now==k){
			pre[i]++;
			now=fail[now];
		}
		suflst[i]=now;
	}
	pw[0]=1;
	fr(i,1,1000000) pw[i]=pw[i-1]*bs;
	fr(i,1,m) hsht[i]=hsht[i-1]*bs+(t[i]-'a'+1);
	fr(i,1,k) hshp[i]=hshp[i-1]*bs+(p[i]-'a'+1);
	fr(i,1,min(m,k-1)) if(gett(1,i)==getp(k-i+1,k)) sum[k-i]++;
	fr(i,1,k) sum[i]+=sum[fail[i]];
	fr(i,0,n){
		ans[n-i]+=pre[i];
		if(suflst[i]) ans[n-i]+=sum[suflst[i]];
	}
	fr(i,0,n) if(i<(n-i)) swap(suflst[i],suflst[n-i]);
	fr(i,0,n){
		if(!prelst[i]||!suflst[i]) continue;
		qry[prelst[i]].push_back(i);
	}
	dfs2(0);
	fr(i,0,n) ans[i]+=res;
	ll maxx=0,cntt=0,posl=inf,posr=-inf;
	fr(i,0,n) maxx=max(maxx,ans[i]);
	fr(i,0,n){
		if(ans[i]==maxx){
			cntt++;
			posl=min(posl,i);
			posr=max(posr,i);
		}
	}
	pf("%lld %lld %lld %lld\n",maxx,cntt,posl,posr);
}