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 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

C. Beaver

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAfter Fox Ciel got off a bus, she found that the bus she was on was a wrong bus and she lost her way in a strange town. However, she fortunately met her friend Beaver Taro and asked which way to go to her castle. Taro's response to her was a string *s*, and she tried to remember the string *s* correctly.

However, Ciel feels *n* strings *b*_{1}, *b*_{2}, ... , *b*_{n} are really boring, and unfortunately she dislikes to remember a string that contains a boring substring. To make the thing worse, what she can remember is only the contiguous substring of *s*.

Determine the longest contiguous substring of *s* that does not contain any boring string, so that she can remember the longest part of Taro's response.

Input

In the first line there is a string *s*. The length of *s* will be between 1 and 10^{5}, inclusive.

In the second line there is a single integer *n* (1 ≤ *n* ≤ 10). Next *n* lines, there is a string *b*_{i} (1 ≤ *i* ≤ *n*). Each length of *b*_{i} will be between 1 and 10, inclusive.

Each character of the given strings will be either a English alphabet (both lowercase and uppercase) or a underscore ('_') or a digit. Assume that these strings are case-sensitive.

Output

Output in the first line two space-separated integers *len* and *pos*: the length of the longest contiguous substring of *s* that does not contain any *b*_{i}, and the first position of the substring (0-indexed). The position *pos* must be between 0 and |*s*| - *len* inclusive, where |*s*| is the length of string *s*.

If there are several solutions, output any.

Examples

Input

Go_straight_along_this_street

5

str

long

tree

biginteger

ellipse

Output

12 4

Input

IhaveNoIdea

9

I

h

a

v

e

N

o

I

d

Output

0 0

Input

unagioisii

2

ioi

unagi

Output

5 5

Note

In the first sample, the solution is traight_alon.

In the second sample, the solution is an empty string, so the output can be «0 0», «0 1», «0 2», and so on.

In the third sample, the solution is either nagio or oisii.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/21/2019 06:36:09 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|