//I play to win
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pi pair<int,int>
#define ld long double
#define vi vector<int>
#define all(x) begin(x),end(x)
using namespace std;
const int N=1e5+10;
struct BIT
{
    int c[N];
    void add(int l,int r,int v){Add(l,v),Add(r+1,-v);}
    void Add(int x,int v){for(;x<N;x+=x&-x)c[x]+=v;}
    int ask(int x){int r=0;for(;x;x&=x-1)r+=c[x];return r;}
}T;
char s[N],t[N],p[N],rs[N],rt[N],rp[N];
int nxtp[N],nxtrp[N],nxtt[N],nxtrt[N];
int n,m,k,ans[N],ansc[N];
void get_nxt(char *s,int *nxt)
{
    nxt[0]=-1;
    for(int i=2,j=0;s[i];i++)
    {
        while(~j&&s[j+1]!=s[i])j=nxt[j];
        nxt[i]=++j;
    }
}
vector<int>getq(char *s,char *t,int *nxt,int sz)
{
    int j=0;
    vector<int>q;
    for(int i=1;s[i];i++,j++)
        while(~j&&t[j+1]!=s[i])j=nxt[j];
    if(j==sz)j=nxt[j];
    while(j)q.push_back(sz-j),j=nxt[j];
    return q;
}
int c[N];
void solve(char *s,char *t,int*nxt,vector<int>&q)
{
    memset(c,0,sizeof c);
    for(int x:q)c[x]++;
    for(int i=1;t[i];i++)c[i]+=c[nxt[i]];
    memset(ansc,0,sizeof ansc);
    for(int i=1,j=0;s[i];i++)
    {
        while(~j&&s[i]!=t[j+1])j=nxt[j];
        ansc[i]=c[++j];
    }
}
vector<int>v[N];
vector<array<int,3>>M[N];
vector<pi>Q[N];
int bg1[N],ed1[N],bg2[N],ed2[N],cnt,pos1[N],pos2[N];
void dfs(int x,int *bg,int* ed)
{bg[x]=++cnt;for(int y:v[x])dfs(y,bg,ed);ed[x]=cnt;}
void buildT(int*nxt,int sz)
{v[0].clear();for(int i=1;i<=sz;i++)v[i].clear(),v[nxt[i]].push_back(i);}
void getpos(char *s,char *t,int *nxt,int *pos)
{
    for(int i=1,j=0;s[i];i++)
    {
        while(~j&&s[i]!=t[j+1])j=nxt[j];
        pos[i]=++j;
    }
}
void match(char*s,char*t,int*nxt)
{
    memset(ansc,0,sizeof ansc);
    for(int i=1,j=0;s[i];i++)
    {
        while(~j&&s[i]!=t[j+1])j=nxt[j];
        if(!t[++j+1])j=nxt[j],ansc[i]++;
        ansc[i]+=ansc[i-1];
    }
}
int main()
{
    scanf("%s%s%s",s+1,t+1,p+1);
    n=strlen(s+1),m=strlen(t+1),k=strlen(p+1);
    memcpy(rs,s,N),memcpy(rt,t,N),memcpy(rp,p,N);
    reverse(rs+1,rs+n+1),reverse(rt+1,rt+m+1),reverse(rp+1,rp+k+1);
    get_nxt(p,nxtp),get_nxt(rp,nxtrp),get_nxt(t,nxtt),get_nxt(rt,nxtrt);
    match(s,p,nxtp);
    for(int i=1;i<=n;i++)ans[i]+=ansc[i];
    match(rs,rp,nxtrp);
    for(int i=1;i<=n;i++)ans[n-i]+=ansc[i];
    vector<int>q;
    q=getq(p,t,nxtt,k);
    solve(s,p,nxtp,q);
    for(int i=1;i<=n;i++)ans[i]+=ansc[i];
    q=getq(rp,rt,nxtrt,k);
    solve(rs,rp,nxtrp,q);
    for(int i=1;i<=n;i++)ans[n-i]+=ansc[i];
    if(m<k)
    {
        q.clear();
        for(int i=2,j=0;i<k;i++)
        {
            while(~j&&t[j+1]!=p[i])j=nxtt[j];
            if(++j==m)j=nxtt[j],q.push_back(i);
        }
        buildT(nxtp,k),cnt=0,dfs(0,bg1,ed1);
        buildT(nxtrp,k),cnt=0,dfs(0,bg2,ed2);
        for(int x:q)
        {
            int l1=bg1[x-m],r1=ed1[x-m],l2=bg2[k-x],r2=ed2[k-x];
            M[l1].push_back({l2,r2,1});
            M[r1+1].push_back({l2,r2,-1});
        }
        getpos(s,p,nxtp,pos1);
        getpos(rs,rp,nxtrp,pos2);
        for(int i=1;i<n;i++)
            Q[bg1[pos1[i]]].push_back({bg2[pos2[n-i]],i});
        for(int i=1;i<=k+1;i++)
        {
            for(auto[l,r,v]:M[i])T.add(l,r,v);
            for(auto[p,id]:Q[i])ans[id]+=T.ask(p);
        }
    }
    else 
    {
        match(t,p,nxtp);
        for(int i=0;i<=n;i++)ans[i]+=ansc[m];
    }
    int mx=0,c=0,lp=0,rp=0;
    for(int i=0;i<=n;i++)
        if(ans[i]>mx)mx=ans[i],c=1,lp=rp=i;
        else if(ans[i]==mx)c++,rp=i;
    cout<<mx<<" "<<c<<" "<<lp<<" "<<rp<<endl;
}