#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5,mod1=998244353,mod2=1e9+7,bas1=12345,bas2=54321;

int ksm1(int a,int x){
	int tot=1;
	while(x){
		if(x & 1ll) tot=1ll*tot*a%mod1;
		a=1ll*a*a%mod1;
		x>>=1ll;
	}
	return tot;
}
int ksm2(int a,int x){
	int tot=1;
	while(x){
		if(x & 1ll) tot=1ll*tot*a%mod2;
		a=1ll*a*a%mod2;
		x>>=1ll;
	}
	return tot;
}

class HashTable{
	public:
	int pw1[N],pw2[N],ipw1[N],ipw2[N];
	int str[N],s1[N],s2[N];
	void init(char *S,int n){
		pw1[0]=ipw1[0]=1; int ibas1=ksm1(bas1,mod1-2);
		for(int i=1;i<=n;i++) pw1[i]=1ll*pw1[i-1]*bas1%mod1,ipw1[i]=1ll*ipw1[i-1]*ibas1%mod1;
		
		pw2[0]=ipw2[0]=1; int ibas2=ksm2(bas2,mod2-2);
		for(int i=1;i<=n;i++) pw2[i]=1ll*pw2[i-1]*bas2%mod2,ipw2[i]=1ll*ipw2[i-1]*ibas2%mod2;
		
		for(int i=1;i<=n;i++) str[i]=S[i]-'a';
		for(int i=1;i<=n;i++)
			s1[i]=(s1[i-1]+1ll*str[i]*pw1[i]%mod1)%mod1,
			s2[i]=(s2[i-1]+1ll*str[i]*pw2[i]%mod2)%mod2;
	}
	
	pair<int,int> ghas(int l,int r){
		return make_pair(1ll*(s1[r]+mod1-s1[l-1])%mod1*ipw1[l]%mod1,1ll*(s2[r]+mod2-s2[l-1])%mod2*ipw2[l]%mod2);
	}
};

int ans[N];
char S[N],T[N],P[N];

int pre[N],suf[N];

int f[N],s[N];
int p[N],id,lim[N],limm[N];

int main(){
	scanf("%s",S+1);
	scanf("\n%s",T+1);
	scanf("\n%s",P+1);
	
	HashTable A,B,C;
	int n=strlen(S+1),m=strlen(T+1),k=strlen(P+1);
	A.init(S,n); B.init(T,m); C.init(P,k);
	
	for(int i=k;i<=n;i++){
		pre[i]=pre[i-1];
		if(A.ghas(i-k+1,i)==C.ghas(1,k)) pre[i]++;
	}
	for(int i=n-k+1;i>=0;i--){
		suf[i]=suf[i+1];
		if(A.ghas(i,i+k-1)==C.ghas(1,k)) suf[i]++;
	}
	
	int alc=0;
	for(int i=1;i<=m-k+1;i++)
		if(B.ghas(i,i+k-1)==C.ghas(1,k)) alc++;
	for(int i=0;i<=n;i++) ans[i]=pre[i]+suf[i+1]+alc;
	
	
	
	for(int i=1;i<=n;i++){
		int l=1,r=min(n-i+1,k),tot=l-1;
		while(l<=r){
			int mid=(l+r)>>1;
			if(A.ghas(i,i+mid-1)==C.ghas(1,mid)) tot=mid,l=mid+1;
			else r=mid-1;
		}
		lim[i]=tot;
	}
	for(int i=1;i<=n;i++){
		int l=1,r=min(i,k),tot=l-1;
		while(l<=r){
			int mid=(l+r)>>1;
			if(A.ghas(i-mid+1,i)==C.ghas(k-mid+1,k)) tot=mid,l=mid+1;
			else r=mid-1;
		}
		limm[i]=tot;
	}
	for(int F=0;F<=1;F++){
		memset(f,0,sizeof(f));
		for(int i=1;i<=min(m,k-1);i++){
			if(B.ghas(1,i)==C.ghas(k-i+1,k)) f[k-i]=1;
		}
		
		id=0;
		for(int i=1;i<=k;i++)
			if(f[i]) p[++id]=i;
		p[id+1]=k+1;
		
		for(int l=1,r;l<=id;l=r+1){
			int d=p[l+1]-p[l];
			r=l;
			while(r+1<=id && p[r+1]-p[r]==d) r++;
			for(int i=0;i<=n;i++) s[i]=0;
			
			for(int i=1;i<=n;i++){
				int R=F?limm[n+1-i]:lim[i];
				if(p[l]<=R){
					int rgt=min(p[r],p[l]+(R-p[l])/d*d);
					s[i+p[l]-1]++,s[i+rgt+d-1]--;
				}
			}
			for(int i=d;i<=n;i++) s[i]+=s[i-d];
			
			if(!F) for(int i=0;i<=n;i++) ans[i]+=s[i];
			else for(int i=0;i<=n;i++) ans[i]+=s[n-i];
		}
		
		reverse(S+1,S+n+1);
		reverse(T+1,T+m+1);
		reverse(P+1,P+k+1);
		A.init(S,n); B.init(T,m); C.init(P,k);
	}
	
	memset(f,0,sizeof(f));
	for(int i=2;i<=k-m;i++){
		if(B.ghas(1,m)==C.ghas(i,i+m-1)) f[i]=1;
	}
	id=0;
	for(int i=1;i<=k;i++)
		if(f[i]) p[++id]=i;
	p[id+1]=k+1;
	
	for(int l=1,r;l<=id;l=r+1){
		int d=p[l+1]-p[l];
		r=l;
		while(r+1<=id && p[r+1]-p[r]==d) r++;
		for(int i=0;i<=n;i++) s[i]=0;
		
		for(int i=1;i<=n;i++){
			int L=k-m+1-limm[i+(k-m)-1],R=lim[i]+1;
			if(L>R) continue;
			if(R>=p[l]){
				int rgt=min(p[r],p[l]+(R-p[l])/d*d);
				s[i+p[l]-2]++,s[i+rgt-2+d]--;
			}
			if(L>p[l]){
				int rgt=min(p[r],p[l]+(L-1-p[l])/d*d);
				s[i+p[l]-2]--,s[i+rgt-2+d]++;
			}
		}
		for(int i=d;i<=n;i++) s[i]+=s[i-d];
		for(int i=0;i<=n;i++) ans[i]+=s[i];
	}
	
	int mx=0,mxer1,mxer2,c=0;
	for(int i=0;i<=n;i++) mx=max(mx,ans[i]);
	for(int i=0;i<=n;i++) if(ans[i]==mx) mxer2=i;
	for(int i=n;i>=0;i--) if(ans[i]==mx) mxer1=i;
	for(int i=0;i<=n;i++) if(ans[i]==mx) c++;
	cout<<mx<<" "<<c<<" "<<mxer1<<" "<<mxer2;
}