#include <bits/stdc++.h>
#define int long long
using namespace std;
char str[100005],dc[100005],pt[100005],news[100005];
int n,m,q,ans1=-1,ans2,ans3,ans4,jie[2][100005];
const int mod[2]={1000000007,1000000009},base[2]={229,233};
struct hax{
	int v[2];
	hax(){v[0]=0,v[1]=0;}
	hax operator+(int c){
		hax ret;
		for(int i=0;i<2;i++)ret.v[i]=(v[i]*base[i]+c)%mod[i];
		return ret;
	}
	bool operator==(hax b){
		return v[0]==b.v[0]&&v[1]==b.v[1];
	}
}ha[100005],ne[100005];
hax get(int l,int r){
	hax ret=ne[r];
	for(int i=0;i<2;i++){
		ret.v[i]=(ret.v[i]-ne[l-1].v[i]*jie[i][r-l+1]%mod[i]+mod[i])%mod[i];
	}
	return ret;
}
hax teg(int l,int r){
	hax ret=ha[r];
	for(int i=0;i<2;i++){
		ret.v[i]=(ret.v[i]-ha[l-1].v[i]*jie[i][r-l+1]%mod[i]+mod[i])%mod[i];
	}
	return ret;
}
void sub1(){
	ha[0]=hax();
	for(int i=1;i<=q;i++)ha[i]=ha[i-1]+(int)pt[i];
	for(int i=0;i<=n;i++){
		int cnt=0,ge=0;
		if(i==0)for(int j=1;j<=m;j++)news[++cnt]=dc[j];
		for(int j=1;j<=n;j++){
			news[++cnt]=str[j];
			if(i==j)for(int k=1;k<=m;k++)news[++cnt]=dc[k];
		}
		ne[0]=hax();
		for(int j=1;j<=cnt;j++)ne[j]=ne[j-1]+(int)news[j];
		for(int j=1;j+q-1<=cnt;j++){
			if(get(j,j+q-1)==ha[q])ge++;
		}
		if(ge>ans1){
			ans1=ge,ans2=1,ans3=ans4=i;
		}
		else if(ge==ans1)ans2++,ans4=i;
	}
	printf("%lld %lld %lld %lld",ans1,ans2,ans3,ans4);
}
int fail[100005],sum[100005],ans[100005],g[100005];
void init(){
	ha[0]=ne[0]=hax();
	for(int i=1,j=0;i<=q;i++){
		while(j&&pt[i+1]!=pt[j+1])j=fail[j];
		if(pt[i+1]==pt[j+1])j++;
		fail[i+1]=j;
		ha[i]=ha[i-1]+pt[i];
	}
	for(int i=1;i<=m;i++){
		ne[i]=ne[i-1]+dc[i];
	}
}
void sub2(){
	init();
	for(int i=1;i<q;i++){
		g[i]=g[fail[i]];
		if(teg(i+1,q)==get(1,q-i))g[i]++;
	}
	for(int i=1,j=0;i<=n;i++){
		while(j&&str[i]!=pt[j+1])j=fail[j];
		if(str[i]==pt[j+1])j++;
		if(j==q)j=fail[j];
		ans[i]+=g[j];
	}
	reverse(pt+1,pt+q+1),reverse(dc+1,dc+m+1),reverse(str+1,str+n+1);
	init();
	for(int i=1;i<q;i++){
		g[i]=g[fail[i]];
		if(teg(i+1,q)==get(1,q-i))g[i]++;
	}
	for(int i=1,j=0;i<=n;i++){
		while(j&&str[i]!=pt[j+1])j=fail[j];
		if(str[i]==pt[j+1])j++;
		if(j==q)j=fail[j];
		ans[n-i]+=g[j];
	}
	reverse(pt+1,pt+q+1),reverse(dc+1,dc+m+1),reverse(str+1,str+n+1);
	init();
	for(int i=0,j=0;i<n;i++){
		while(j&&str[i+1]!=pt[j+1])j=fail[j];
		if(str[i+1]==pt[j+1])j++;
		sum[i+1]=sum[i];
		if(j==q)sum[i+1]++;
	}
	int tot=0;
	for(int i=1,j=0;i<=m;i++){
		while(j&&dc[i]!=pt[j+1])j=fail[j];
		if(dc[i]==pt[j+1])j++;
		if(j==q)tot++;
	}
	for(int i=0;i<=n;i++){
		ans[i]+=tot+sum[n];
		ans[i]-=sum[min(n,i+q-1)]-sum[i];
		if(ans[i]>ans1){
			ans1=ans[i],ans2=1,ans3=ans4=i;
		}
		else if(ans[i]==ans1)ans2++,ans4=i;
	}
	printf("%lld %lld %lld %lld\n",ans1,ans2,ans3,ans4);
}
signed main(){
	for(int i=0;i<2;i++){
		jie[i][0]=1;
		for(int j=1;j<=1e5;j++)jie[i][j]=jie[i][j-1]*base[i]%mod[i];
	}
	scanf("%s",str+1);n=strlen(str+1);
	scanf("%s",dc+1);m=strlen(dc+1);
	scanf("%s",pt+1);q=strlen(pt+1);
	if(n<=5000&&m<=5000&&q<=5000)sub1(),exit(0);
	if(m>=q)sub2(),exit(0);
	return 0;
}