B"After 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 b1, xe2 x80 x89b2, xe2 x80 x89... , xe2 x80 x89bn 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. In the first line there is a string s. The length of s will be between 1 and 105, inclusive. In the second line there is a single integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910). Next n lines, there is a string bi (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n). Each length of bi 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 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 bi, and the first position of the substring (0-indexed). The position pos must be between 0 and |s| xe2 x80 x89- xe2 x80 x89len inclusive, where |s| is the length of string s. If there are several solutions, output any. In the first sample, the solution is traight_alon. In the second sample, the solution is an empty string, so the output can be xc2 xab0 0 xc2 xbb, xc2 xab0 1 xc2 xbb, xc2 xab0 2 xc2 xbb, and so on. In the third sample, the solution is either nagio or oisii."...