Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1.


For example, with A = "abcd" and B = "cdabcdab". 


Return 3, because by repeating A three times (“abcdabcdabcd”), B is a substring of it; and B is not a substring of A repeated two times ("abcdabcd").


Note:
The length of A and B will be between 1 and 10000.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution(object):\n     # Rabin-Karp Algorithm (rolling hash)\n     def repeatedStringMatch1(self, A, B):\n         """\n         :type A: str\n         :type B: str\n         :rtype: int\n         """\n         def check(index):\n             return all(A[(i+index) % len(A)] == c\n                    for i, c in enumerate(B))\n \n         M, p = 10**9+7, 113\n         p_inv = pow(p, M-2, M)\n         q = (len(B)+len(A)-1) // len(A)\n \n         b_hash, power = 0, 1\n         for c in B:\n             b_hash += power * ord(c)\n             b_hash %= M\n             power = (power*p) % M\n \n         a_hash, power = 0, 1\n         for i in range(len(B)):\n             a_hash += power * ord(A[i%len(A)])\n             a_hash %= M\n             power = (power*p) % M\n \n         if a_hash == b_hash and check(0): return q\n \n         power = (power*p_inv) % M\n         for i in range(len(B), (q+1)*len(A)):\n             a_hash = (a_hash-ord(A[(i-len(B))%len(A)])) * p_inv\n             a_hash += power * ord(A[i%len(A)])\n             a_hash %= M\n             if a_hash == b_hash and check(i-len(B)+1):\n                 return q if i < q*len(A) else q+1\n \n         return -1\n     #KMP\n     def repeatedStringMatch(self, A, B):\n         """\n         :type A: str\n         :type B: str\n         :rtype: int\n         """\n  \n         def get_fail(s):\n             f = [0] * (len(s) + 1)\n             for i in range(1, len(s)):\n                 j = f[i]\n                 while j and s[i] != s[j]: j = f[j]\n                 if s[i] == s[j]: j += 1\n                 f[i + 1] = j\n             return f\n  \n         # kmp\n         f = get_fail(B)\n         j = 0\n         vis = {0}\n         cnt = 1\n         while True:\n             for i in range(len(A)):\n                 while j and A[i] != B[j]: j = f[j]\n                 if A[i] == B[j]: j += 1\n                 if j == len(B):\n                     return cnt\n             if j in vis: return -1 \n             vis.add(j)\n             cnt += 1\n         return -1\n \n     \n     \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'repeatedStringMatch'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 5990