For technical reasons, some programming languages (Kotlin, C #) will not be available during round 877.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. String Transformation

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLet *s* be a string whose length equals *n*. Its characters are numbered from 0 to *n* - 1, *i* and *j* are integers, 0 ≤ *i* < *j* < *n*. Let's define function *f* as follows:

*f*(*s*, *i*, *j*) = *s*[*i* + 1... *j* - 1] + *r*(*s*[*j*... *n* - 1]) + *r*(*s*[0... *i*]).

Here *s*[*p*... *q*] is a substring of string *s*, that starts in position *p* and ends in position *q* (inclusive); "+" is the string concatenation operator; *r*(*x*) is a string resulting from writing the characters of the *x* string in the reverse order. If *j* = *i* + 1, then the substring *s*[*i* + 1... *j* - 1] is considered empty.

You are given two strings *a* and *b*. Find such values of *i* and *j*, that *f*(*a*, *i*, *j*) = *b*. Number *i* should be maximally possible. If for this *i* there exists several valid values of *j*, choose the minimal *j*.

Input

The first two input lines are non-empty strings *a* and *b* correspondingly. Each string's length does not exceed 10^{6} characters. The strings can contain any characters with ASCII codes from 32 to 126 inclusive.

Output

Print two integers *i*, *j* — the answer to the problem. If no solution exists, print "-1 -1" (without the quotes).

Examples

Input

Die Polizei untersucht eine Straftat im IT-Bereich.

untersucht eine Straftat.hciereB-TI mi ieziloP eiD

Output

11 36

Input

cbaaaa

aaaabc

Output

4 5

Input

123342

3324212

Output

-1 -1

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/23/2017 21:37:02 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|