#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define bit(n) (1LL << (n))
#define getbit(x, i) (((x) >> (i)) & 1)
#define pii pair<int, int>
#define ALL(x) (x).begin(), (x).end()
#define sz(x) ((int) (x).size())
using namespace std;
const int M = 5e5 + 5;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e9;
const long long ooo = 1e18;
const double pi = acos(-1);

template<typename T1, typename T2> bool mini(T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

typedef long long ll;



vector<int> calc(string s, string t) {
    string str = s + "#" + t;
    int n = str.size();
    vector<int> z(n, 0);
    for (int i = 1, l = 0, r = 0; i < n; i++) {
        int &k = z[i];
        if (i < r)
            k = min(r - i, z[i - l]);
        while (i + k < n && str[k] == str[i + k])
            k++;

        if (i + k > r) {
            l = i;
            r = i + k;
        }
    }
    reverse(ALL(z));
    z.resize(sz(t));
    reverse(ALL(z));
    return z;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef LOCAL
    freopen("file.inp", "r",stdin);
    #endif

    string s, t, p;
    cin >> s >> t >> p;
    int n = sz(s), m = sz(t), k = sz(p);

    vector<int> zs = calc(p, s);
    vector<int> pre(n + 1, 0), suf(n + 1, 0);
    for (int i = 0; i < n; i++) if (zs[i] == k) {
        pre[i + k]++;
        suf[i]++;
    }

    for (int i = 1; i <= n; i++) {
        pre[i] += pre[i - 1];
    }

    for (int i = n - 1; i >= 0; i--) {
        suf[i] += suf[i + 1];
    }

    vector<int> cnt(n + 1, 0);

    for (int i = 0; i <= n; i++) {
        cnt[i] = pre[i] + suf[i];
    }

    vector<int> pt = calc(p, t);

    int num = 0;
    for (int i = 0; i < m; i++) {
        if (pt[i] == k) {
            num++;
        }
    }

    for (int i = 0; i <= n; i++) {
        cnt[i] += num;
    }

    auto solvemid = [&]() -> void {
        bitset<N> lef, rig, mid;

        vector<vector<tuple<bool, int>>> events(n + 1);
        // {lef/rig, value}
        for (int i = 0; i < n; i++) {
            if (zs[i] > 0) {
                events[i + 1].push_back({0, i});
                if (i + zs[i] + 1 <= n) {
                    events[i + zs[i] + 1].push_back({0, i});
                }
            }
        }

        reverse(ALL(s));
        reverse(ALL(p));
        vector<int> revzs = calc(p, s);
        reverse(ALL(revzs));
        reverse(ALL(s));
        reverse(ALL(p));

        for (int i = 0; i < n; i++) {
            if (revzs[i] > 0) {
                events[i + 1].push_back({1, i - (k - m) + 1});
                events[i - revzs[i] + 1].push_back({1, i - (k - m) + 1});
            }
        }

        vector<int> tp = calc(t, p);
        for (int i = 0; i < k; i++) {
            if (tp[i] == m) {
                mid[k - i] = 1;
            }
        }

        for (int i = 0; i <= n; i++) {
            for (auto [side, v] : events[i]) if (v >= 0) {
                if (side == false) {
                    lef.flip(v);
                } else {
                    rig.flip(v);
                }
            }

            // for (int j = 0; j < n; j++) {
            //     cout << lef[j];
            // }
            // cout << "\n";
            // for (int j = 0; j < n; j++) {
            //     if (i <= k) {
            //         cout << (mid >> (k - i))[j];
            //     } else {
            //         cout << (mid << (i - k))[j];
            //     }
            // }
            // cout << "\n";
            // for (int j = 0; j < n; j++) {
            //     cout << rig[j];
            // }
            // cout << "\n";
            // cout << "-------------\n";

            if (i <= k) {
                cnt[i] += (lef & rig & (mid >> (k - i))).count();
            } else {
                cnt[i] += (lef & rig & (mid << (i - k))).count();
            }
        }
    };

    if (k > m) {
        solvemid();
    }

    auto solve = [&](bool isrev) -> void {
        bitset<N> lef, mid;
        vector<vector<int>> events(n + 1);
        vector<int> zs = calc(p, s);
        for (int i = 0; i < n; i++) {
            if (zs[i] > 0) {
                events[i + 1].push_back(i);
                if (i + zs[i] + 1 <= n) {
                    events[i + zs[i] + 1].push_back(i);
                }
            }
        }

        reverse(ALL(p));
        reverse(ALL(t));
        vector<int> revpt = calc(p, t);
        reverse(ALL(revpt));
        reverse(ALL(p));
        reverse(ALL(t));

        for (int i = 0; i < m; i++) {
            if (revpt[i] == i + 1 && i + 1 < k) {
                mid[i + 1] = true;
            }
        }

        for (int i = 0; i <= n; i++) {
            for (int v : events[i]) if (v >= 0) {
                lef.flip(v);
            }

            // for (int j = 0; j < n; j++) {
            //     cout << lef[j];
            // }
            // cout << "\n";
            // for (int j = 0; j < n; j++) {
            //     if (i <= k) {
            //         cout << (mid >> (k - i))[j];
            //     } else {
            //         cout << (mid << (i - k))[j];
            //     }
            // }
            // cout << "\n";
            // cout << "-------------\n";

            if (i <= k) {
                cnt[(!isrev ? i : (n - i))] += (lef & (mid >> (k - i))).count();
            } else {
                cnt[(!isrev ? i : (n - i))] += (lef & (mid << (i - k))).count();
            }
        }
    }; 

    solve(0);

    reverse(ALL(s));
    reverse(ALL(t));
    reverse(ALL(p));
    solve(1);


    int mx = *max_element(ALL(cnt));
    vector<int> ans;
    for (int i = 0; i <= n; i++) {
        if (cnt[i] == mx) {
            ans.push_back(i);
        }
    }

    cout << mx << " " << sz(ans) << " " << ans[0] << " " << ans.back() << "\n";
    return 0;
}