#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
const int MAXN = 100005;

char ss[MAXN], st[MAXN], sp[MAXN], rs[MAXN], rt[MAXN], rp[MAXN];
int ns, nt, np, PinT, ans[MAXN];

struct Data {
    int nxt[MAXN], smc[MAXN], tmc[MAXN], sum[MAXN];
    vector<int> g[MAXN];

    void Kmp(bool flag, char *p, char *t) {
        int k = 0;
        for (int i = 2; i <= np; ++i) {
            while (k && p[k + 1] != p[i]) {
                k = nxt[k];
            }
            if (p[k + 1] == p[i]) {
                ++k;
            }
            nxt[i] = k;
        }
        k = 0;
        for (int i = 1; i <= nt; ++i) {
            while (k && p[k + 1] != t[i]) {
                k = nxt[k];
            }
            if (p[k + 1] == t[i]) {
                ++k;
            }
            PinT += (flag && k == np);
        }
        for (; k; k = nxt[k]) {
            if (k < np) {
                ++tmc[k];
            }
        }
        for (int i = 1; i <= np; ++i) {
            g[nxt[i]].push_back(i);
        }
    }

    void Calc(bool flag, char *p, char *s, int *mc) {
        for (int i = 1; i <= np; ++i) {
            sum[i] = sum[nxt[i]] + mc[np - i];
        }
        int k = 0, tot = 0;
        for (int i = 1; i <= ns; ++i) {
            while (k && p[k + 1] != s[i]) {
                k = nxt[k];
            }
            if (p[k + 1] == s[i]) {
                ++k;
            }
            smc[i] = k;
            tot += (k == np);
            if (flag) {
                ans[i] += tot + sum[k];
            } else {
                ans[ns - i] += tot + sum[k];
            }
        }
    }
} A, B;

int nxt[MAXN], pmc[MAXN];
int dfn[MAXN], out[MAXN], clk;
vector< pair<int, int> > Q[MAXN];

struct BIT {
    int tr[MAXN];
    inline void add(int x, int v) {
        for (; x <= clk; x += (x & (-x))) {
            tr[x] += v;
        }
    }
    inline void upd(int l, int r, int v) {
        add(l, v);
        add(r + 1, -v);
    }
    inline int sum(int x) {
        int ret = 0;
        for (; x; x -= (x & (-x))) {
            ret += tr[x];
        }
        return ret;
    }
} bit;

void DFS1(int u) {
    dfn[u] = ++clk;
    for (auto v : B.g[u]) {
        DFS1(v);
    }
    out[u] = clk;
}

void DFS2(int u) {
    if (u && pmc[u + nt]) {
        bit.upd(dfn[np - u - nt], out[np - u - nt], 1);
    }
    for (auto [v, id] : Q[u]) {
        ans[id] += bit.sum(dfn[v]);
    }
    for (auto v : A.g[u]) {
        DFS2(v);
    }
    if (u && pmc[u + nt]) {
        bit.upd(dfn[np - u - nt], out[np - u - nt], -1);
    }
}

void TinP() {
    int k = 0;
    for (int i = 2; i <= nt; ++i) {
        while (k && st[k + 1] != st[i]) {
            k = nxt[k];
        }
        if (st[k + 1] == st[i]) {
            ++k;
        }
        nxt[i] = k;
    }
    k = 0;
    for (int i = 1; i < np; ++i) {
        while (k && st[k + 1]!= sp[i]) {
            k = nxt[k];
        }
        if (st[k + 1] == sp[i]) {
            ++k;
        }
        pmc[i] = (k == nt);
    }
    for (int i = 1; i < ns; ++i) {
        if (A.smc[i] && B.smc[ns - i]) {
            Q[A.smc[i]].push_back(make_pair(B.smc[ns - i], i));
        }
    }
    DFS1(0);
    DFS2(0);
}

void solve() {
    scanf("%s", ss + 1);
    ns = strlen(ss + 1);
    copy(ss, ss + ns + 1, rs);
    reverse(rs + 1, rs + ns + 1);
    scanf("%s", st + 1);
    nt = strlen(st + 1);
    copy(st, st + nt + 1, rt);
    reverse(rt + 1, rt + nt + 1);
    scanf("%s", sp + 1);
    np = strlen(sp + 1);
    copy(sp, sp + np + 1, rp);
    reverse(rp + 1, rp + np + 1);
    A.Kmp(1, sp, st);
    B.Kmp(0, rp, rt);
    A.Calc(1, sp, ss, B.tmc);
    B.Calc(0, rp, rs, A.tmc);
    if (np >= nt + 2) {
        TinP();
    }
    int mx = 0;
    for (int i = 0; i <= ns; ++i) {
        mx = max(mx, ans[i]);
    }
    int cnt = 0, l = -1, r = 0;
    for (int i = 0; i <= ns; ++i) {
        if (ans[i] == mx) {
            ++cnt;
            if (l == -1) l = i;
            r = i;
        }
    }
    printf("%d %d %d %d\n", mx + PinT, cnt, l, r);
}

int main() {
    solve();
    return 0;
}