#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 2E5;

int fen[N];

void add(int x, int y) {
	for (int i = x + 1; i <= N; i += i & -i) {
		fen[i - 1] += y;
	}
}

int sum(int x) {
	int ans = 0;
	for (int i = x; i; i &= (i - 1)) {
		ans += fen[i - 1];
	}
	return ans;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	std::string s, t, p;
	std::cin >> s >> t >> p;

	int S = s.size(), T = t.size(), P = p.size();

	auto s1 = std::string(s.rbegin(), s.rend());
	auto t1 = std::string(t.rbegin(), t.rend());
	auto p1 = std::string(p.rbegin(), p.rend());

	std::vector<int> f(P + 1), f1(P + 1);
	for (int i = 1, j = 0; i < P; i++) {
		while (j && p[i] != p[j]) {
			j = f[j];
		}
		j += (p[i] == p[j]);
		f[i + 1] = j;
	}
	for (int i = 1, j = 0; i < P; i++) {
		while (j && p1[i] != p1[j]) {
			j = f1[j];
		}
		j += (p1[i] == p1[j]);
		f1[i + 1] = j;
	}

	std::vector<int> ans(S + 1);
	std::vector<int> suf(S + 1), suf1(S + 1);
	int cnt = 0;
	for (int i = 0, j = 0; i <= S; i++) {
		cnt += (j == P);
		suf[i] = j;
		ans[i] += cnt;
		if (i == S) {
			break;
		}
		while (j && (j == P || s[i] != p[j])) {
			j = f[j];
		}
		j += (s[i] == p[j]);
	}
	cnt = 0;
	for (int i = 0, j = 0; i <= S; i++) {
		cnt += (j == P);
		suf1[i] = j;
		ans[S - i] += cnt;
		if (i == S) {
			break;
		}
		while (j && (j == P || s1[i] != p1[j])) {
			j = f1[j];
		}
		j += (s1[i] == p1[j]);
	}
	cnt = 0;
	int sufT, sufT1;
	for (int i = 0, j = 0; i <= T; i++) {
		cnt += (j == P);
		if (i == T) {
			sufT = j;
			break;
		}
		while (j && (j == P || t[i] != p[j])) {
			j = f[j];
		}
		j += (t[i] == p[j]);
	}
	for (int i = 0, j = 0; i <= T; i++) {
		if (i == T) {
			sufT1 = j;
			break;
		}
		while (j && (j == P || t1[i] != p1[j])) {
			j = f1[j];
		}
		j += (t1[i] == p1[j]);
	}
	for (int i = 0; i <= S; i++) {
		ans[i] += cnt;
	}
	
	std::vector<int> a(P + 1), a1(P + 1);
	for (int i = sufT1; i; i = f1[i]) {
		if (i < P) {
			a[P - i] += 1;
		}
	}
	for (int i = sufT; i; i = f[i]) {
		if (i < P) {
			a1[P - i] += 1;
		}
	}
	for (int i = 1; i <= P; i++) {
		a[i] += a[f[i]];
	}
	for (int i = 1; i <= P; i++) {
		a1[i] += a1[f1[i]];
	}
	for (int i = 0; i <= S; i++) {
		ans[i] += a[suf[i]];
		ans[i] += a1[suf1[S - i]];
	}
	
	std::vector<int> ft(T + 1);
	for (int i = 1, j = 0; i < T; i++) {
		while (j && t[i] != t[j]) {
			j = ft[j];
		}
		j += (t[i] == t[j]);
		ft[i + 1] = j;
	}

	std::vector<std::vector<int>> adj(P + 1), adj1(P + 1);
	for (int i = 1; i <= P; i++) {
		adj[f[i]].push_back(i);
		adj1[f1[i]].push_back(i);
	}

	std::vector<int> in(P + 1), out(P + 1), in1(P + 1), out1(P + 1);

	int cur = 0;
	std::function<void(int)> dfs1 = [&](int x) -> void {
		in[x] = cur++;
		for (auto y : adj[x]) {
			dfs1(y);
		}
		out[x] = cur;
	};
	dfs1(0);

	cur = 0;
	std::function<void(int)> dfs2 = [&](int x) -> void {
		in1[x] = cur++;
		for (auto y : adj1[x]) {
			dfs2(y);
		}
		out1[x] = cur;
	};
	dfs2(0);

	std::vector<std::array<int, 3>> pts;
	for (int i = 0, j = 0; i < P; i++) {
		while (j && (j == T || p[i] != t[j])) {
			j = ft[j];
		}
		j += (p[i] == t[j]);
		if (j == T && i < P - 1 && i + 1 - T > 0) {
			int u = i + 1 - T;
			int v = P - 1 - i;
			pts.push_back({in[u], in1[v], 1});
			pts.push_back({in[u], out1[v], -1});
			pts.push_back({out[u], in1[v], -1});
			pts.push_back({out[u], out1[v], 1});
		}
	}

	std::sort(pts.begin(), pts.end());

	std::vector<std::array<int, 3>> qry;
	for (int i = 0; i <= S; i++) {
		qry.push_back({in[suf[i]], in1[suf1[S - i]], i});
	}
	std::sort(qry.begin(), qry.end());

	int i = 0;
	for (auto [x, y, k] : qry) {
		while (i < pts.size() && pts[i][0] <= x) {
			add(pts[i][1], pts[i][2]);
			i++;
		}
		ans[k] += sum(y + 1);
//		std::cerr << "query " << x << " " << y << " " << sum(y + 1) << "\n";
	}

//	for (int i = 0; i <= S; i++) {
//		std::cerr << ans[i] << "\n";
//	}

	int max = *std::max_element(ans.begin(), ans.end());
	int count = 0, left = S, right = 0;
	for (int i = 0; i <= S; i++) {
		if (ans[i] == max) {
			count += 1;
			left = std::min(left, i);
			right = i;
		}
	}
	std::cout << max << " " << count << " " << left << " " << right << "\n";

	return 0;
}