#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)

const int N = 300005;
int S, T, P, fail[N], fail1[N], pre[N], suf[N], ans[N], sum[N];
char s[N], t[N], p[N], p1[N];
int id[N], eid[N], id1[N], eid1[N], dfn, dfn1;
vector<int> e[N], e1[N];
vector<pair<int, int>> event[N], qry[N];

void kmp(int P, char *p, int *fail) {
    for (int i = 2, j = 0; i <= P; ++i) {
        while (j && p[j + 1] != p[i]) j = fail[j];
        if (p[j + 1] == p[i]) ++j;
        fail[i] = j;
    }
}

void solve(bool tp) {
    int offset = 0, j = 0, cnt = 0;
    per(i, T, 1) {
        while (j && p1[j + 1] != t[i]) j = fail1[j];
        if (j < P && p1[j + 1] == t[i]) ++j;
        offset += (j == P);
    }

    memset(sum, 0, (P + 1) * 4);
    for (; j; j = fail1[j]) if (j < P) sum[P - j] = 1;
    rep(i, 2, P) sum[i] += sum[fail[i]];
    
    j = 0;
    if (!tp) {
        rep(i, 0, S) ans[i] += offset;
        rep(i, 1, S) {
            while (j && p[j + 1] != s[i]) j = fail[j];
            if (j < P && p[j + 1] == s[i]) ++j;
            cnt += (j == P);
            ans[i] += cnt + sum[j];
            pre[i] = j;
            // cerr << "??? " << ans[i] << "\n";
        }
    } else {
        per(i, S, 1) {
            while (j && p[j + 1] != s[i]) j = fail[j];
            if (j < P && p[j + 1] == s[i]) ++j;
            cnt += (j == P);
            ans[i - 1] += cnt + sum[j];
            suf[i - 1] = j;
        }
    }
}

void dfs(int u) {
    id[u] = ++dfn;
    for (auto v : e[u]) dfs(v);
    eid[u] = dfn;
}
void dfs1(int u) {
    id1[u] = ++dfn1;
    for (auto v : e1[u]) dfs1(v);
    eid1[u] = dfn1;
}

namespace BIT {
    int c[N];
    void modify(int p, int x) {
        for (; p <= P + 1; p += p & -p) c[p] += x;
    }
    int query(int p) {
        int res = 0;
        for (; p; p -= p & -p) res += c[p];
        return res;
    }
}

void push(int l1, int r1, int l2, int r2) {
    event[l1].push_back({l2, 1});
    event[l1].push_back({r2 + 1, -1});
    event[r1 + 1].push_back({l2, -1});
    event[r1 + 1].push_back({r2 + 1, 1});
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> (s + 1) >> (t + 1) >> (p + 1);
    S = strlen(s + 1);
    T = strlen(t + 1);
    P = strlen(p + 1);
    
    kmp(P, p, fail);
    rep(i, 1, P) p1[i] = p[P - i + 1];
    p1[P + 1] = '\0';
    kmp(P, p1, fail1);

    rep(tp, 0, 1) {
        solve(tp);
        swap(p, p1);
        swap(fail, fail1);
        reverse(t + 1, t + T + 1);
    }

    if (T + 2 <= P) {
        rep(i, 1, P) e[fail[i]].push_back(i), e1[fail1[i]].push_back(i);
        kmp(T, t, fail);
        dfs(0), dfs1(0);
        rep(i, 0, P + 1) event[i].clear(), qry[i].clear();
        for (int i = 1, j = 0; i <= P; ++i) {
            while (j && t[j + 1] != p[i]) j = fail[j];
            if (j < T && t[j + 1] == p[i]) ++j;
            if (j == T) {
                int a = i - T, b = P - T - a;
                if (!a || !b) continue;
                push(id[a], eid[a], id1[b], eid1[b]);
            }
        }
        rep(i, 1, S - 1) {
            int a = id[pre[i]], b = id1[suf[i]];
            qry[a].push_back({b, i});
        }
        rep(i, 1, P + 1) {
            for (auto it : event[i]) BIT::modify(it.first, it.second);
            for (auto it : qry[i]) ans[it.second] += BIT::query(it.first);
        }
    }

    int mn = -1, mx = -1, cnt = 0, val = -1;
    rep(i, 0, S) {
        if (ans[i] > val) {
            val = ans[i];
            mn = mx = i;
            cnt = 1;
        } else if (ans[i] == val) {
            ++cnt;
            mx = i;
        }
    }
    cout << val << " " << cnt << " " << mn << " " << mx << "\n";

    return 0;
}