#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


struct Hld {
  int n, rt;
  // needs to be tree
  // vertex lists
  // modified in build(rt) (parent removed, heavy child first)
  vector<vector<int>> graph;
  vector<int> sz, par, dep;
  int zeit;
  vector<int> dis, fin, sid;
  // head vertex (minimum depth) in heavy path
  vector<int> head;

  Hld() : n(0), rt(-1), zeit(0) {}
  explicit Hld(int n_) : n(n_), rt(-1), graph(n), zeit(0) {}
  void ae(int u, int v) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    graph[u].push_back(v);
    graph[v].push_back(u);
  }

  void dfsSz(int u) {
    sz[u] = 1;
    for (const int v : graph[u]) {
      auto it = std::find(graph[v].begin(), graph[v].end(), u);
      if (it != graph[v].end()) graph[v].erase(it);
      par[v] = u;
      dep[v] = dep[u] + 1;
      dfsSz(v);
      sz[u] += sz[v];
    }
  }
  void dfsHld(int u) {
    dis[u] = zeit++;
    const int deg = graph[u].size();
    if (deg > 0) {
      int vm = graph[u][0];
      int jm = 0;
      for (int j = 1; j < deg; ++j) {
        const int v = graph[u][j];
        if (sz[vm] < sz[v]) {
          vm = v;
          jm = j;
        }
      }
      swap(graph[u][0], graph[u][jm]);
      head[vm] = head[u];
      dfsHld(vm);
      for (int j = 1; j < deg; ++j) {
        const int v = graph[u][j];
        head[v] = v;
        dfsHld(v);
      }
    }
    fin[u] = zeit;
  }
  void build(int rt_) {
    assert(0 <= rt_); assert(rt_ < n);
    rt = rt_;
    sz.assign(n, 0);
    par.assign(n, -1);
    dep.assign(n, -1);
    dep[rt] = 0;
    dfsSz(rt);
    zeit = 0;
    dis.assign(n, -1);
    fin.assign(n, -1);
    head.assign(n, -1);
    head[rt] = rt;
    dfsHld(rt);
    assert(zeit == n);
    sid.assign(n, -1);
    for (int u = 0; u < n; ++u) sid[dis[u]] = u;
  }

  friend ostream &operator<<(ostream &os, const Hld &hld) {
    const int maxDep = *max_element(hld.dep.begin(), hld.dep.end());
    vector<string> ss(2 * maxDep + 1);
    int pos = 0, maxPos = 0;
    for (int j = 0; j < hld.n; ++j) {
      const int u = hld.sid[j];
      const int d = hld.dep[u];
      if (hld.head[u] == u) {
        if (j != 0) {
          pos = maxPos + 1;
          ss[2 * d - 1].resize(pos, '-');
          ss[2 * d - 1] += '+';
        }
      } else {
        ss[2 * d - 1].resize(pos, ' ');
        ss[2 * d - 1] += '|';
      }
      ss[2 * d].resize(pos, ' ');
      ss[2 * d] += std::to_string(u);
      if (maxPos < static_cast<int>(ss[2 * d].size())) {
        maxPos = ss[2 * d].size();
      }
    }
    for (int d = 0; d <= 2 * maxDep; ++d) os << ss[d] << '\n';
    return os;
  }

  bool contains(int u, int v) const {
    return (dis[u] <= dis[v] && dis[v] < fin[u]);
  }
  int lca(int u, int v) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    for (; head[u] != head[v]; ) (dis[u] > dis[v]) ? (u = par[head[u]]) : (v = par[head[v]]);
    return (dis[u] > dis[v]) ? v : u;
  }
  int jumpUp(int u, int d) const {
    assert(0 <= u); assert(u < n);
    assert(d >= 0);
    if (dep[u] < d) return -1;
    const int tar = dep[u] - d;
    for (u = head[u]; ; u = head[par[u]]) {
      if (dep[u] <= tar) return sid[dis[u] + (tar - dep[u])];
    }
  }
  int jump(int u, int v, int d) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(d >= 0);
    const int l = lca(u, v);
    const int du = dep[u] - dep[l], dv = dep[v] - dep[l];
    if (d <= du) {
      return jumpUp(u, d);
    } else if (d <= du + dv) {
      return jumpUp(v, du + dv - d);
    } else {
      return -1;
    }
  }
  // [u, v) or [u, v]
  template <class F> void doPathUp(int u, int v, bool inclusive, F f) const {
    assert(contains(v, u));
    for (; head[u] != head[v]; u = par[head[u]]) f(dis[head[u]], dis[u] + 1);
    if (inclusive) {
      f(dis[v], dis[u] + 1);
    } else {
      if (v != u) f(dis[v] + 1, dis[u] + 1);
    }
  }
  // not path order, include lca(u, v) or not
  template <class F> void doPath(int u, int v, bool inclusive, F f) const {
    const int l = lca(u, v);
    doPathUp(u, l, false, f);
    doPathUp(v, l, inclusive, f);
  }

  // (vs, ps): compressed tree
  // vs: DFS order (sorted by dis)
  // vs[ps[x]]: the parent of vs[x]
  // ids[vs[x]] = x, not set for non-tree vertex
  vector<int> ids;
  pair<vector<int>, vector<int>> compress(vector<int> us) {
    // O(n) first time
    ids.resize(n, -1);
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (dis[u] < dis[v]);
    });
    us.erase(std::unique(us.begin(), us.end()), us.end());
    int usLen = us.size();
    assert(usLen >= 1);
    for (int x = 1; x < usLen; ++x) us.push_back(lca(us[x - 1], us[x]));
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (dis[u] < dis[v]);
    });
    us.erase(std::unique(us.begin(), us.end()), us.end());
    usLen = us.size();
    for (int x = 0; x < usLen; ++x) ids[us[x]] = x;
    vector<int> ps(usLen, -1);
    for (int x = 1; x < usLen; ++x) ps[x] = ids[lca(us[x - 1], us[x])];
    return make_pair(us, ps);
  }
};

////////////////////////////////////////////////////////////////////////////////


template <class X, class Y, class T> struct StaticRectAddPointSum {
  struct Rect {
    X x0, x1;
    Y y0, y1;
  };
  vector<Rect> as;
  vector<pair<X, Y>> bs;
  vector<T> vals, anss;
  // Adds val to [x0, x1) [y0, y1).
  //   ~~> Adds to (x*, y*)
  void add(X x0, X x1, Y y0, Y y1, const T &val) {
    assert(x0 <= x1); assert(y0 <= y1);
    as.push_back(Rect{x0, x1, y0, y1});
    vals.push_back(val);
  }
  // Gets sum at (x, y).
  void get(X x, Y y) {
    bs.emplace_back(x, y);
  }

  void run() {
    const int asLen = as.size(), bsLen = bs.size();

    // same x ==> add then get
    vector<pair<X, int>> events((asLen << 1) + bsLen);
    for (int i = 0; i < asLen; ++i) {
      events[i << 1    ] = std::make_pair(as[i].x0, i << 1    );
      events[i << 1 | 1] = std::make_pair(as[i].x1, i << 1 | 1);
    }
    for (int j = 0; j < bsLen; ++j) {
      events[(asLen << 1) + j] = std::make_pair(bs[j].first, (asLen << 1) + j);
    }
    std::sort(events.begin(), events.end());

    vector<Y> ys(bsLen);
    for (int j = 0; j < bsLen; ++j) {
      ys[j] = bs[j].second;
    }
    std::sort(ys.begin(), ys.end());
    ys.erase(std::unique(ys.begin(), ys.end()), ys.end());
    const int ysLen = ys.size();
    vector<T> bit(ysLen, 0);

    anss.assign(bsLen, 0);
    for (const auto &event : events) {
      if (event.second >= asLen << 1) {
        const int j = event.second - (asLen << 1);
        T sum = 0;
        for (int l = std::lower_bound(ys.begin(), ys.end(), bs[j].second) - ys.begin() + 1; l > 0; l &= l - 1) {
          sum += bit[l - 1];
        }
        anss[j] = sum;
      } else {
        const int i = event.second >> 1;
        const T val = (event.second & 1) ? -vals[i] : vals[i];
        for (int l = std::lower_bound(ys.begin(), ys.end(), as[i].y0) - ys.begin(); l < ysLen; l |= l + 1) {
          bit[l] += val;
        }
        for (int l = std::lower_bound(ys.begin(), ys.end(), as[i].y1) - ys.begin(); l < ysLen; l |= l + 1) {
          bit[l] -= val;
        }
      }
    }
  }
};

////////////////////////////////////////////////////////////////////////////////


vector<int> kmp(const string &p) {
  const int pLen = p.size();
  vector<int> fail(pLen + 1);
  int j = fail[0] = -1;
  for (int i = 0; i < pLen; ++i) {
    for (; ~j && p[j] != p[i]; j = fail[j]) {}
    fail[i + 1] = ++j;
  }
  return fail;
}
vector<int> match(const string &p, const vector<int> &fail, const string &s) {
  const int sLen = s.size();
  vector<int> ma(sLen + 1);
  int j = ma[0] = 0;
  for (int i = 0; i < sLen; ++i) {
    for (; ~j && p[j] != s[i]; j = fail[j]) {}
    ma[i + 1] = ++j;
  }
// cerr<<"[match] "<<p<<" "<<s<<" = "<<ma<<endl;
  return ma;
}

char buf[100'010];

int SLen, TLen, PLen;
string S[2], T[2], P[2];

int main() {
  for (; ~scanf("%s", buf); ) {
    S[0] = buf;
    scanf("%s", buf); T[0] = buf;
    scanf("%s", buf); P[0] = buf;
    
    SLen = S[0].size();
    TLen = T[0].size();
    PLen = P[0].size();
    S[1] = S[0]; reverse(S[1].begin(), S[1].end());
    T[1] = T[0]; reverse(T[1].begin(), T[1].end());
    P[1] = P[0]; reverse(P[1].begin(), P[1].end());
    
    vector<int> failP[2];
    vector<int> maPS[2], maPT[2];
    Hld hldP[2];
    for (int h = 0; h < 2; ++h) {
      failP[h] = kmp(P[h]);
      maPS[h] = match(P[h], failP[h], S[h]);
      maPT[h] = match(P[h], failP[h], T[h]);
      hldP[h] = Hld(PLen + 1);
      for (int j = 1; j <= PLen; ++j) hldP[h].ae(failP[h][j], j);
      hldP[h].build(0);
    }
    
    vector<int> ans(SLen + 1, 0);
    
    // mid
    {
      int cnt = 0;
      for (int i = 0; i <= TLen; ++i) if (maPT[0][i] == PLen) ++cnt;
      for (int i = 0; i <= SLen; ++i) ans[i] += cnt;
    }
    // pre
    // suf
    for (int h = 0; h < 2; ++h) {
      int cnt = 0;
      for (int i = 0; i <= SLen; ++i) {
        if (maPS[h][i] == PLen) ++cnt;
        ans[h ? (SLen - i) : i] += cnt;
      }
    }
    // pre-mid
    // mid-suf
    for (int h = 0; h < 2; ++h) {
      // vertex add, path sum
      vector<int> fs(PLen + 2, 0);
      for (int j = maPT[h ^ 1][TLen]; ~j; j = failP[h ^ 1][j]) {
        if (0 < j && j < PLen) {
          ++fs[hldP[h].dis[PLen - j]];
          --fs[hldP[h].fin[PLen - j]];
        }
      }
      for (int j = 0; j <= PLen; ++j) fs[j + 1] += fs[j];
      for (int i = 0; i <= SLen; ++i) ans[h ? (SLen - i) : i] += fs[hldP[h].dis[maPS[h][i]]];
    }
    // pre-suf
    {
      StaticRectAddPointSum<int, int, int> f;
      const auto failT = kmp(T[0]);
      const auto maTP = match(T[0], failT, P[0]);
      for (int j = TLen + 1; j < PLen; ++j) if (maTP[j] == TLen) {
        f.add(
          hldP[0].dis[j - TLen],
          hldP[0].fin[j - TLen],
          hldP[1].dis[PLen - j],
          hldP[1].fin[PLen - j],
          +1
        );
      }
      for (int i = 0; i <= SLen; ++i) {
        f.get(
          hldP[0].dis[maPS[0][i]],
          hldP[1].dis[maPS[1][SLen - i]]
        );
      }
      f.run();
      for (int i = 0; i <= SLen; ++i) ans[i] += f.anss[i];
    }
    
// cerr<<"ans = "<<ans<<endl;
    {
      const int mx = *max_element(ans.begin(), ans.end());
      int cnt = 0;
      int iMin = SLen + 1, iMax = -1;
      for (int i = 0; i <= SLen; ++i) if (mx == ans[i]) {
        ++cnt;
        chmin(iMin, i);
        chmax(iMax, i);
      }
      printf("%d %d %d %d\n", mx, cnt, iMin, iMax);
    }
  }
  return 0;
}