#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define pb push_back
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(v) ((int)v.size())
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define umap unordered_map
#define uset unordered_set
#define mset multiset
#define ui unsigned int
#define ull unsigned ll
#define i128 __int128
using namespace std;

namespace qiqi {
	struct SAM {
		static const int C = 26;
		struct Node {
			int len,link; array<int,C> ch;
			Node():len(),link(),ch() {}
		};
		vector<Node> t;
		SAM(const string &s) {
			t.assign(2,Node());
			t[0].ch.fill(1); t[0].len = -1;
			const int n = sz(s);
			for (int i = 0,p = 1; i < n; i++) {
				p = ext(p,s[i]-'a');
			}
		}
		int newNode() {
			t.eb(); return sz(t)-1;
		}
		auto &operator [] (int x) {
			return t[x];
		}
		int ext(int p,int c) {
			if (t[p].ch[c]) {
				int q = t[p].ch[c];
				if (t[q].len == t[p].len+1) {
					return q;
				}
				int cur = newNode();
				t[cur].len = t[p].len+1;
				t[cur].link = t[q].link;
				t[cur].ch = t[q].ch;
				t[q].link = cur;
				for (; t[p].ch[c] == q; p = t[p].link) {
					t[p].ch[c] = cur;
				}
				return cur;
			}
			int cur = newNode();
			t[cur].len = t[p].len+1;
			for (; !t[p].ch[c]; p = t[p].link) {
				t[p].ch[c] = cur;
			}
			t[cur].link = ext(p,c);
			return cur;
		}
	};
	void main() {
		string s,t;
		cin >> s >> t;
		SAM st(t);
		const int n = sz(s);
		const int inf = 1e9;
		int ans = -inf;
		pii pans(-1,-1);
		for (int i = 0,p = 1,k = 0; i < n; i++) {
			int c = s[i]-'a';
			while (!st[p].ch[c]) {
				p = st[p].link; k = st[p].len;
			}
			p = st[p].ch[c]; k++;
			int l = i-k+1,r = i;
			if (k != 0 && k-max(l,n-r-1) > ans) {
				ans = k-max(l,n-r-1);
				pans = pair(l,r);
			}
		}
		cout << pans.fi << ' ' << pans.se << '\n';
	}
}

int main() {
//	clock_t st = clock();
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T = 1;
//	cin >> T;
	while (T--) {
		qiqi::main();
	}

//	cout << (double)(clock()-st)/CLOCKS_PER_SEC;
	return 0;
}