#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cassert>
using namespace std;
int read(){
	char c=getchar();int x=0;
	while(c<48||c>57) c=getchar();
	do x=(x<<1)+(x<<3)+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
const int N=100003;
char SA[N],TA[N],PA[N];
char SB[N],TB[N],PB[N];
int Anxt[N],Bnxt[N],Tnxt[N];
int n,m,k,num;
int oc[N],all;
int stk[N],tp,mx;
bool key[N];
int fA[N],fB[N];
int res[N],tr[N];
void update(int x,int v){
	for(int i=x;i<=k+1;i+=(i&-i)) tr[i]+=v;
}
int query(int x){
	int res=0;
	for(int i=x;i;i^=(i&-i)) res+=tr[i];
	return res;
}
struct adj{
	int hd[N],ver[N],nxt[N],tot;
	void add(int u,int v){
		nxt[++tot]=hd[u];hd[u]=tot;ver[tot]=v;
	}
}trA,trB;
int dfnA[N],szA[N],locA[N];
int dfnB[N],szB[N],locB[N];
void dfsA(int u){
	dfnA[u]=++num;szA[u]=1;
	for(int i=trA.hd[u];i;i=trA.nxt[i])
		dfsA(trA.ver[i]),szA[u]+=szA[trA.ver[i]];
}
void dfsB(int u){
	dfnB[u]=++num;szB[u]=1;
	for(int i=trB.hd[u];i;i=trB.nxt[i])
		dfsB(trB.ver[i]),szB[u]+=szB[trB.ver[i]];
}
typedef pair<int,int> pii;
vector<pii> upd[N],qry[N];
int main(){
	scanf("%s",SA+1);memcpy(SB+1,SA+1,n=strlen(SA+1));reverse(SB+1,SB+n+1);
	scanf("%s",TA+1);memcpy(TB+1,TA+1,m=strlen(TA+1));reverse(TB+1,TB+m+1);
	scanf("%s",PA+1);memcpy(PB+1,PA+1,k=strlen(PA+1));reverse(PB+1,PB+k+1);
	for(int i=2,j=0;i<=k;++i){
		while(j&&PA[j+1]!=PA[i]) j=Anxt[j];
		if(PA[j+1]==PA[i]) ++j;
		Anxt[i]=j;
	}
	for(int i=2,j=0;i<=k;++i){
		while(j&&PB[j+1]!=PB[i]) j=Bnxt[j];
		if(PB[j+1]==PB[i]) ++j;
		Bnxt[i]=j;
	}
	int las=0;
	for(int i=1,j=0;i<=m;++i){
		while(j&&PA[j+1]!=TA[i]) j=Anxt[j];
		if(PA[j+1]==TA[i]) ++j;
		if(j==k){
			++all;
			j=Anxt[j];
		}
		las=j;
	}
	while(las) key[k-las]=1,las=Anxt[las];
	for(int i=1;i<=k;++i){
		if(key[i]) ++fB[i],key[i]=0;
		fB[i]+=fB[Bnxt[i]];
	}
	for(int i=1,j=0;i<=m;++i){
		while(j&&PB[j+1]!=TB[i]) j=Bnxt[j];
		if(PB[j+1]==TB[i]) ++j;
		if(j==k) j=Bnxt[j];
		las=j;
	}
	while(las) key[k-las]=1,las=Bnxt[las];
	for(int i=1;i<=k;++i){
		if(key[i]) ++fA[i],key[i]=0;
		fA[i]+=fA[Anxt[i]];
	}
	for(int i=1,j=0;i<=n;++i){
		while(j&&PA[j+1]!=SA[i]) j=Anxt[j];
		if(PA[j+1]==SA[i]) ++j;
		if(j==k){
			++oc[i-k+1];--oc[i];++all;
			j=Anxt[j];
		}
		locA[i]=j;
		res[i]+=fA[j];
	}
	for(int i=1;i<=n;++i) oc[i]+=oc[i-1];
	for(int i=0;i<=n;++i) res[i]+=all-oc[i];
	for(int i=1,j=0;i<=n;++i){
		while(j&&PB[j+1]!=SB[i]) j=Bnxt[j];
		if(PB[j+1]==SB[i]) ++j;
		if(j==k) j=Bnxt[j];
		locB[n-i]=j;
		res[n-i]+=fB[j];
	}
	if(m+1<k){
		for(int i=1;i<=k;++i) trA.add(Anxt[i],i);
		num=0;dfsA(0);
		for(int i=1;i<=k;++i) trB.add(Bnxt[i],i);
		num=0;dfsB(0);
		for(int i=2,j=0;i<=m;++i){
			while(j&&TA[j+1]!=TA[i]) j=Tnxt[j];
			if(TA[j+1]==TA[i]) ++j;
			Tnxt[i]=j;
		}
		for(int i=1,j=0;i<=k;++i){
			while(j&&TA[j+1]!=PA[i]) j=Tnxt[j];
			if(TA[j+1]==PA[i]) ++j;
			if(j==m){
				if(i<k&&i>m){
					upd[dfnA[i-m]].emplace_back(dfnB[k-i],1);
					upd[dfnA[i-m]].emplace_back(dfnB[k-i]+szB[k-i],-1);
					upd[dfnA[i-m]+szA[i-m]].emplace_back(dfnB[k-i],-1);
					upd[dfnA[i-m]+szA[i-m]].emplace_back(dfnB[k-i]+szB[k-i],1);
				}
				j=Tnxt[j];
			}
		}
	}
	for(int i=0;i<=n;++i)
		if(locA[i]&&locB[i])
			qry[dfnA[locA[i]]].emplace_back(dfnB[locB[i]],i);
	for(int i=1;i<=k+1;++i){
		for(pii cur:upd[i]) update(cur.first,cur.second);
		for(pii cur:qry[i]) res[cur.second]+=query(cur.first);
	}
	for(int i=0;i<=n;++i){
		if(res[i]>mx) mx=res[i],tp=0;
		if(res[i]==mx) stk[++tp]=i;
		//printf("%d ",res[i]);
	}
	//putchar('\n');
	printf("%d %d %d %d\n",mx,tp,stk[1],stk[tp]);
	return 0;
}