#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(),x.end()
#define rep(i,x,y) for(auto i(x);i<=(y);++i)
#define Rep(i,x,y) for(auto i(x);i>=(y);--i)
using namespace std;
namespace KMP {
	vector<int> getfail (string s,int siz) {
		vector<int> nxt(siz + 1) ;
		int j = nxt[1] = 0 ; 
		rep (i,2,siz) {
			while (j && s[j + 1] != s[i]) j = nxt[j] ;
			if (s[j + 1] == s[i]) ++ j ;
			nxt[i] = j; 
		}
		return nxt; 
	} 
}
int tim = 0 ; 
struct failtree {
	const int siz; 
	vector <int> fail ;
	vector<vector<int>> ed ;
	failtree(vector<int>_fail) : siz((int)_fail.size( ) - 1) , fail(_fail) {
		ed.resize(siz + 1) ; 
		rep (i,1,siz) {
			ed [fail[i]].emplace_back (i) ;
		}
		rep (i,0,siz) ed[i].shrink_to_fit( ) ;
	} 
	inline void dfs(int u,vector<int> &St,vector<int> &Ed) {
		St[u] = ++ tim ;
		for (int v:ed[u]) {
			dfs(v,St,Ed) ;			
		}
		Ed[u] = tim ; 	
	}
	void getdfn (vector<int> &St,vector<int> &Ed) {
		tim = 0 ; 
		St.resize(siz + 1) , Ed.resize(siz + 1) ;
		dfs(0,St,Ed) ;
	}
} ; 
signed main ( ) {
	ios::sync_with_stdio (false) , cin.tie (0) , cout.tie (0) ; 
	string s,o,t,ro,rt; 
	int n , m , l ; 
	cin >> s >> o >> t ; ro = o ; reverse(all(ro)) ; rt = t ; reverse (all(rt)) ;
	n = s.size( ) , m = o.size( ) , l = t.size( ) ;	
	auto index1=[](string &str) {str="<"+str+">";}; 
	index1 (s) ; index1(o) ; index1 (t) ; index1(ro) ; index1(rt) ;
	failtree ft(KMP::getfail(t,l)),frt(KMP::getfail(rt,l)); 
	vector<int>ans(n+2),sufp(n+2),cnt1(l+1),cnt2(l+1),pres(n+1),st,ed,pos,nxto=KMP::getfail(o,m);
	vector<bool>TinS(n+1),TsufO(m+1),TpreO(m+1),OinT(l+1);
	int TinO = 0 , j = 0 ; 
	rep (i,1,n) {
		while (j && t[j + 1] != s[i]) j = ft.fail [j] ;
		if (t[ j + 1 ] == s[i]) ++ j ;		
		if (j == l) TinS[i - l + 1] = 1  ;		
	} 
	j = 0 ;
	rep (i,1,m) {
		while (j && t[j + 1] != o[i]) j = ft.fail [j] ;
		if (t[ j + 1 ] == o[i]) ++ j ;
		if (j == l) TinO ++ ;
	}
	if (j == m) j = ft.fail[j] ;
	while (j) {
		TsufO[m - j + 1] = 1 ;
		j = ft.fail[j] ;
	}
	j = 0 ; 
	Rep (i,m,1) { 
		while (j && rt[j + 1] != o[i]) j = frt.fail [j] ; 
		if (rt[j + 1] == o[i]) ++ j ; 
	}
	if (j == m) j = frt.fail[j] ;
	while (j) {
		TpreO[j] = 1 ;
		j = frt.fail[j] ;
	} 
 	
	if (m < l) {	
		j = 0 ; 
		rep (i,1,l) {
			while (j && o[j + 1] != t[i]) j = nxto[j] ;
			if (o[j + 1] == t[i]) ++ j ; 
			if (j == m) OinT[i - m + 1] = 1; 
		}	 
	}
	rep(i,1,n) pres[i] = pres[i - 1] + TinS[i];
	rep(i,1,n + 1) {
		ans[i] = pres[n] - pres[i - 1] + TinO ;
		if (i - l >= 0) {
			ans[i] += pres[i - l] ;
		} 
	}
	pres.clear( ); pres.shrink_to_fit();
	TinS.clear( ); TinS.shrink_to_fit();

	rep (i,1,l) {
		if (l - i <= m && l != i) cnt2[i] = TsufO[m - (l - i) + 1] ;
		if (l - i <= m) cnt1[i] = TpreO[l - i] ;
		cnt2[i] += cnt2 [ frt.fail[i] ] ;
		cnt1[i] += cnt1 [ ft.fail[i] ] ; 
	}

	j = 0 ;
	Rep (i,n,1) {
		while (j && rt[j + 1] != s[i]) j = frt.fail[j] ;
		if (rt[j + 1] == s[i]) ++ j ;
		sufp[i] = j ; 	
		ans[i] += cnt2 [j] ; 
	}
	frt.getdfn (st , ed) ;
	struct bit {
		vector<int> t; 
		inline void add (int l,int r,int c) {
			for (l ++ ; l < t.size(); l += l & -l) t[l] += c; 
			for (r ++ ; r < t.size(); r += r & -r) t[r] -= c; 
		}
		inline int qry (int p,int c = 0) {
			for (p ++ ; p ; p &= p - 1) c += t[p] ;
			return c; 
		}
	}T;
	T.t.resize(l + 3);
	auto ins = [&] (int x) {		
		if (x<l&&OinT[x + 1]) { 
			T.add (st[l - x - m] , ed[l - x - m] + 1 , 1) ;
		}
	} ; 
	auto del = [&] (int x) {
		if (x<l&&OinT[x + 1]) {
			T.add (st[l - x - m] , ed[l - x - m] + 1 , -1) ;
		}  
	} ;
	j = 0 ; 
	vector <vector<int>> qat(l + 1) ;
	rep (i,1,n + 1) {	
		ans[i] += cnt1[j] ;
		qat [j].emplace_back (i) ; 
		if (i == n + 1) break ; 		
		while (j && s[i] != t[j + 1]) j = ft.fail[j] ; 
		if (s[i] == t[j + 1]) {
			++ j ;
		} 
	}
	rep (i,0,l) qat[i].shrink_to_fit( ) ;
	function<void(int)> dfs = [&](int u) {
		ins (u) ;
		for (int qr : qat[u]) ans [qr] += T.qry (st[sufp[qr]]); 
		for (int v : ft.ed[u]) dfs (v) ;
		del(u) ;
	} ; 
	dfs(0) ;
	int mx = 0 ; 
	rep (i,1,n + 1) {
		if (ans[i] > mx) {
			mx = ans[i] ;
			pos.clear ( ) ;
		}
		if (ans[i] == mx) {
			pos.emplace_back (i - 1) ;
		}
	}
	cout << mx << ' ' << pos.size( ) << ' ' << pos.front ( ) << ' ' << pos.back ( ) << '\n' ;
}