#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

int n, m, k, v1[N], v2[N], op, ans[N], a1[N], a2[N], p1[N], p2[N];

struct kmp {
	int nxt[N], ps[N];
	char S[N], T[N], P[N];
	int init(int o) {
		for (int i = 2, j = 0; i <= k; i++) {
			while (j && P[j + 1] != P[i]) j = nxt[j];
			if (P[j + 1] == P[i]) j++;
			nxt[i] = j;
		}
		int j = 0;
		for (int i = 1; i <= m; i++) {
			while (j && (j == k || P[j + 1] != T[i])) j = nxt[j];
			if (P[j + 1] == T[i]) j++;
			if (o && j == k) ++op;
		}
		return j;
	}
} A, B;

namespace extra {
	int nxt[N], vis[N], st[N], ed[N], tot;
	vector<int> g1[N], g2[N];
	vector<pair<int, int>> o[N];
	void dfs(int u) {
		st[u] = ++tot;
		for (auto v : g2[u]) dfs(v);
		ed[u] = tot;
	}
	int tr[N];
	void modify(int x, int y) {
		for (; x <= tot; x += x & -x) tr[x] += y;
	}
	int query(int x) {
		int res = 0;
		for (; x; x -= x & -x) res += tr[x];
		return res;
	}
	void dfs2(int u) {
		if (u && vis[u + m] && k - m - u > 0) {
			int v = k - m - u;
			modify(st[v], 1);
			modify(ed[v] + 1, -1);
		}
		for (auto p : o[u]) {
			ans[p.second] += query(st[p.first]);
		}
		for (auto v : g1[u])
			dfs2(v);
		if (u && vis[u + m] && k - m - u > 0) {
			int v = k - m - u;
			modify(st[v], -1);
			modify(ed[v] + 1, 1);
		}
	}
	void main() {
		for (int i = 2, j = 0; i <= m; i++) {
			while (j && A.T[j + 1] != A.T[i]) j = nxt[j];
			if (A.T[j + 1] == A.T[i]) j++;
			nxt[i] = j;
		}
		for (int i = 1, j = 0; i <= k; i++) {
			while (j && (j == m || A.T[j + 1] != A.P[i])) j = nxt[j];
			if (A.T[j + 1] == A.P[i]) j++;
			vis[i] = j == m;
		}
		for (int i = 1; i <= k; i++) {
			g1[A.nxt[i]].emplace_back(i);
			g2[B.nxt[i]].emplace_back(i);
		}
		dfs(0);
		for (int i = 0; i <= n; i++) {
			int u = p1[i], v = p2[n - i];
			if (u && v)
				o[u].emplace_back(v, i);
		}
		dfs2(0);
	}	
};

int main() {
	// freopen("lgs.in", "r", stdin);
	// freopen("lgs.out", "w", stdout);
	scanf("%s", A.S + 1), n = strlen(A.S + 1);
	scanf("%s", A.T + 1), m = strlen(A.T + 1);
	scanf("%s", A.P + 1), k = strlen(A.P + 1);
	for (int i = 1; i <= n; i++)
		B.S[i] = A.S[n - i + 1];
	for (int i = 1; i <= m; i++)
		B.T[i] = A.T[m - i + 1];
	for (int i = 1; i <= k; i++)
		B.P[i] = A.P[k - i + 1];
	int rp = A.init(0);
	int lp = B.init(1);
	if (lp == k) lp = B.nxt[lp];
	while (lp) {
		++v1[lp], lp = B.nxt[lp];
	}
	if (rp == k) rp = A.nxt[rp];
	while (rp) {
		++v2[rp], rp = A.nxt[rp];
	}
	for (int i = 1; i <= k; i++)
		a1[i] = a1[A.nxt[i]] + v1[k - i];
	for (int i = 1; i <= k; i++)
		a2[i] = a2[B.nxt[i]] + v2[k - i];
	for (int i = 0, j = 0, cur = 0; i <= n; i++) {
		while (j && (j == k || A.P[j + 1] != A.S[i])) j = A.nxt[j];
		if (A.P[j + 1] == A.S[i]) j++;
		if (j == k) ++cur;
		ans[i] += cur + a1[p1[i] = j];
	}
	for (int i = 0, j = 0, cur = 0; i <= n; i++) {
		while (j && (j == k || B.P[j + 1] != B.S[i])) j = B.nxt[j];
		if (B.P[j + 1] == B.S[i]) j++;
		if (j == k) ++cur;
		ans[n - i] += cur + a2[p2[i] = j];
	}
	if (m < k)
		extra::main();
	int mx = *max_element(ans, ans + n + 1), cnt = 0, pl = -1, pr = -1;
	for (int i = 0; i <= n; i++) {
		if (ans[i] == mx) {
			++cnt;
			pr = i;
			if (pl == -1) pl = i;
		}
	}
	printf("%d %d %d %d\n", mx + op, cnt, pl, pr);
	cerr << clock() << endl;
	return 0;
}