#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 200000
using namespace std;
struct reads
{
    int num,x,y,data;
    bool operator < (const reads &t)const
    {
        return (x!=t.x)?x<t.x:num<t.num;
    }
};
reads tong[6*N+1];
int length,leng,leng2,c[N+1],nt[N+1],nt2[N+1],nt3[N+1],maxn[N+1],maxn2[N+1],cnt[N+1],cnt2[N+1],dfn[N+1],dfn2[N+1],sz[N+1],sz2[N+1],ans[N+1];
bool used[N+1],used2[N+1];
vector<int>E[N+1];
vector<int>E2[N+1];
string s,t,p;
int lowbit(int x)
{
    return x&(-x);
}
void add(int x,int d)
{
    for (;x<=leng2;x+=lowbit(x)) c[x]+=d;
    return;
}
int query(int x)
{
    int res=0;
    for (;x>=1;x-=lowbit(x)) res+=c[x];
    return res;
}
void dfs(int x)
{
    dfn[x]=++leng,sz[x]=1;
    for (int i=0;i<E[x].size();++i) dfs(E[x][i]),sz[x]+=sz[E[x][i]];
    return;
}
void dfs2(int x)
{
    dfn2[x]=++leng2,sz2[x]=1;
    for (int i=0;i<E2[x].size();++i) dfs2(E2[x][i]),sz2[x]+=sz2[E2[x][i]];
    return;
}
int main()
{
    int ps=0,res=0,tans=0,cnts=0,l=-1,r=-1;
    cin>>s>>t>>p;
    for (int i=2;i<=p.length();++i)
    {
	while (ps&&p[ps]!=p[i-1]) ps=nt[ps];
	if (ps<p.length()&&p[ps]==p[i-1]) ps++;
	nt[i]=ps;
    }
    ps=nt2[p.length()]=p.length()+1;
    for (int i=p.length()-1;i>=1;--i)
    {
	while (ps!=p.length()+1&&p[ps-2]!=p[i-1]) ps=nt2[ps];
	if (ps-2>=0&&p[ps-2]==p[i-1]) ps--;
	nt2[i]=ps;
    }
    ps=0;
    for (int i=1;i<=s.length();++i)
    {
	while (ps&&p[ps]!=s[i-1]) ps=nt[ps];
	if (ps<p.length()&&p[ps]==s[i-1]) ps++;
	if (ps==p.length()) res++;
	ans[i]+=res,maxn[i]=ps;
    }
    ps=maxn2[s.length()+1]=p.length()+1,res=0;
    for (int i=s.length();i>=1;--i)
    {
	while (ps!=p.length()+1&&p[ps-2]!=s[i-1]) ps=nt2[ps];
	if (ps-2>=0&&p[ps-2]==s[i-1]) ps--;
	if (ps==1) res++;
	ans[i-1]+=res,maxn2[i]=ps;
    }
    ps=res=0;
    for (int i=1;i<=t.length();++i)
    {
	while (ps&&p[ps]!=t[i-1]) ps=nt[ps];
	if (ps<p.length()&&p[ps]==t[i-1]) ps++;
	if (ps==p.length()) res++;
    }
    used[ps]=1,ps=p.length()+1;
    for (int i=t.length();i>=1;--i)
    {
	while (ps!=p.length()+1&&p[ps-2]!=t[i-1]) ps=nt2[ps];
	if (ps-2>=0&&p[ps-2]==t[i-1]) ps--;
    }
    used2[ps]=1;
    for (int i=0;i<=s.length();++i) ans[i]+=res;
    for (int i=p.length();i>=1;--i) used[nt[i]]|=used[i];
    for (int i=1;i<=p.length();++i) used2[nt2[i]]|=used2[i];
    for (int i=1;i<=p.length()-1;++i)
    {
	if (used2[i+1]) cnt[i]++;
	if (used[i]) cnt2[i+1]++;
    }
    for (int i=1;i<=p.length();++i) cnt[i]+=cnt[nt[i]];
    for (int i=p.length();i>=1;--i) cnt2[i]+=cnt2[nt2[i]];
    for (int i=0;i<=s.length();++i) ans[i]+=cnt[maxn[i]]+cnt2[maxn2[i+1]];
    for (int i=1;i<=p.length();++i) E[nt[i]].push_back(i);
    for (int i=p.length();i>=1;--i) E2[nt2[i]].push_back(i);
    dfs(0),dfs2(p.length()+1),ps=0;
    for (int i=2;i<=t.length();++i)
    {
	while (ps&&t[ps]!=t[i-1]) ps=nt3[ps];
	if (ps<t.length()&&t[ps]==t[i-1]) ps++;
	nt3[i]=ps;
    }
    ps=0;
    for (int i=1;i<=p.length();++i)
    {
	while (ps&&t[ps]!=p[i-1]) ps=nt3[ps];
	if (ps<p.length()&&t[ps]==p[i-1]) ps++;
	if (ps==t.length()&&i-t.length()+1!=1&&i!=p.length())
	{
	    tong[++length]=(reads){-1,dfn[i-t.length()],dfn2[i+1],1};
	    tong[++length]=(reads){-1,dfn[i-t.length()]+sz[i-t.length()],dfn2[i+1],-1};
	    tong[++length]=(reads){-1,dfn[i-t.length()],dfn2[i+1]+sz2[i+1],-1};
	    tong[++length]=(reads){-1,dfn[i-t.length()]+sz[i-t.length()],dfn2[i+1]+sz2[i+1],1};
	}
    }
    for (int i=1;i<=s.length()-1;++i)
	if (maxn[i]&&maxn2[i+1]!=p.length()+1)
	    tong[++length]=(reads){i,dfn[maxn[i]],dfn2[maxn2[i+1]],0};
    sort(tong+1,tong+length+1);
    for (int i=1;i<=length;++i)
    {
	if (tong[i].num==-1) add(tong[i].y,tong[i].data);
	else ans[tong[i].num]+=query(tong[i].y);
    }
    for (int i=0;i<=s.length();++i) tans=max(tans,ans[i]);
    for (int i=0;i<=s.length();++i)
	if (tans==ans[i])
	{
	    if (l==-1) l=i;
	    cnts++,r=i;
	}
    printf("%d %d %d %d\n",tans,cnts,l,r);
    return 0;
}