Problem Statement

Given are two strings $s$ and $t$ consisting of lowercase English letters. Determine if the number of non-negative integers $i$ satisfying the following condition is finite, and find the maximum value of such $i$ if the number is finite.

• There exists a non-negative integer $j$ such that the concatenation of $i$ copies of $t$ is a substring of the concatenation of $j$ copies of $s$.

Note

• A string $a$ is a substring of another string $b$ if and only if there exists an integer $x$ $(0 \leq x \leq |b| - |a|)$ such that, for any $y$ $(1 \leq y \leq |a|)$, $a_y = b_{x+y}$ holds.
• We assume that the concatenation of zero copies of any string is the empty string. From the definition above, the empty string is a substring of any string. Thus, for any two strings $s$ and $t$, $i = 0$ satisfies the condition in the problem statement.

Constraints

• $1 \leq |s| \leq 5 \times 10^5$
• $1 \leq |t| \leq 5 \times 10^5$
• $s$ and $t$ consist of lowercase English letters.

Input

Input is given from Standard Input in the following format:

s
t

Output

If the number of non-negative integers $i$ satisfying the following condition is finite, print the maximum value of such $i$; if the number is infinite, print -1.