#include<bits/stdc++.h>
using namespace std;
char S[101000],T[101000],P[101000],Z[101000];
int n,m,q;
namespace Sub1{
	int kmp[5010];
	void sol(){
		for(int i=2,j=0;i<=q;i++){
			while(j&&P[j+1]!=P[i])j=kmp[j];
			if(P[j+1]==P[i])j++;kmp[i]=j;
		}
		int ans=-1,ac=0,al=-1,ar=-1;
		for(int z=0;z<=n;z++){
			int su=0,t=0;
			for(int i=1;i<=z;i++){while(t&&P[t+1]!=S[i])t=kmp[t];if(P[t+1]==S[i])t++;if(t==q)su++,t=kmp[t];}
			for(int i=1;i<=m;i++){while(t&&P[t+1]!=T[i])t=kmp[t];if(P[t+1]==T[i])t++;if(t==q)su++,t=kmp[t];}
			for(int i=z+1;i<=n;i++){while(t&&P[t+1]!=S[i])t=kmp[t];if(P[t+1]==S[i])t++;if(t==q)su++,t=kmp[t];}
			if(su>ans)ans=su,ac=1,al=ar=z;
			else if(su==ans)ac++,ar=z;
		}
		printf("%d %d %d %d",ans,ac,al,ar);
	}
}
int su[101000];
int kmp[101000],kmp2[101000],q1[101000],q2[101000],s1[101000],s2[101000];
int t1[101000],t2[101000];
void print(){
	int ans=-1,ac=0,al=-1,ar=-1;
	for(int i=0;i<=n;i++){
		if(su[i]>ans)ans=su[i],ac=1,al=ar=i;
		else if(su[i]==ans)ac++,ar=i;
	}
	printf("%d %d %d %d",ans,ac,al,ar);
}
void sol(){
	for(int i=2,j=0;i<=q;i++){while(j&&P[j+1]!=P[i])j=kmp[j];if(P[j+1]==P[i])j++;kmp[i]=j;}
	for(int i=2,j=0;i<=q;i++){while(j&&Z[j+1]!=Z[i])j=kmp2[j];if(Z[j+1]==Z[i])j++;kmp2[i]=j;}
	for(int i=1,j=0;i<=n;i++){
		if(j==q)j=kmp[j];
		while(j&&P[j+1]!=S[i])j=kmp[j];if(P[j+1]==S[i])j++;
		q1[i]=j;
		s1[i]=s1[i-1]+(j==q);
	}
	for(int i=n,j=0;i;i--){
		if(j==q)j=kmp2[j];
		while(j&&Z[j+1]!=S[i])j=kmp2[j];if(Z[j+1]==S[i])j++;
		q2[i]=j;
		s2[i]=s2[i+1]+(j==q);
	}
	int w1=0,sg=0;
	for(int i=1;i<=m;i++){
		while(w1&&P[w1+1]!=T[i])w1=kmp[w1];if(P[w1+1]==T[i])w1++;
		if(w1==q)sg++,w1=kmp[w1];
	}
	int w2=0;
	for(int i=m;i;i--){
		while(w2&&Z[w2+1]!=T[i])w2=kmp2[w2];if(Z[w2+1]==T[i])w2++;
		if(w2==q)w2=kmp2[w2];
	}
	while(w1)t2[q-w1]++,w1=kmp[w1];
	while(w2)t1[q-w2]++,w2=kmp2[w2];
	for(int i=1;i<=q;i++)t1[i]+=t1[kmp[i]],t2[i]+=t2[kmp2[i]];
	for(int i=0;i<=n;i++)su[i]=s1[i]+s2[i+1]+t1[q1[i]]+t2[q2[i+1]]+sg;
}
#define pb push_back
int km[101000];
struct ed{int l,r,z;};
vector<ed>g[101000],qu[101000];
int tr[101000];
const int N=1e5+10;
void ad(int x,int z){for(;x<=N;x+=(x&-x))tr[x]+=z;}
int ask(int x){int s=0;for(;x;x-=(x&-x))s+=tr[x];return s;}
struct Tree{
	int dfn[101000],sz[101000],ee;
	vector<int>g[101000];
	void ad(int u,int v){g[u].push_back(v);}
	void dfs(int x){dfn[x]=++ee,sz[x]=1;for(int v:g[x])dfs(v),sz[x]+=sz[v];}
}T1,T2;
void sol2(){
	for(int i=1;i<=q;i++)T1.ad(kmp[i],i),T2.ad(kmp2[i],i);
	T1.dfs(0),T2.dfs(0);
	for(int i=2,j=0;i<=m;i++){
		while(j&&T[j+1]!=T[i])j=km[j];
		if(T[j+1]==T[i])j++;km[i]=j;
	}
	for(int i=1,j=0;i<=q;i++){
		while(j&&T[j+1]!=P[i])j=km[j];
		if(T[j+1]==P[i])j++;
		if(j==m&&i-m+1>1&&i<q){
			int u=i-m,v=q-i;
			int ul=T1.dfn[u],ur=T1.dfn[u]+T1.sz[u]-1;
			int vl=T2.dfn[v],vr=T2.dfn[v]+T2.sz[v]-1;
			g[ul].pb((ed){vl,vr,1}),g[ur+1].pb((ed){vl,vr,-1});
		}
		if(j==m)j=km[j];
	}
	for(int i=0;i<=n;i++)qu[T1.dfn[q1[i]]].pb((ed){T2.dfn[q2[i+1]],0,i});
	for(int i=1;i<=N;i++){
		for(ed t:g[i])ad(t.l,t.z),ad(t.r+1,-t.z);
		for(ed t:qu[i])su[t.z]+=ask(t.l);
	}
}
int main(){
	scanf("%s%s%s",S+1,T+1,P+1);
	n=strlen(S+1),m=strlen(T+1),q=strlen(P+1);
	if(n<=5000&&m<=5000&&q<=5000){Sub1::sol();return 0;} 
	for(int i=1;i<=q;i++)Z[i]=P[q+1-i];
	sol();if(m>=q){print();return 0;}
	sol2();print();
	return 0;
}