A newspaper is published in Walrusland. Its heading is s₁, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string. After that walrus erase several letters from this string in order to get a new word s₂. It is considered that when Fangy erases some letter, there's no whitespace formed instead of the letter. That is, the string remains unbroken and it still only consists of lowercase Latin letters.

For example, the heading is "abc". If we take two such headings and glue them one to the other one, we get "abcabc". If we erase the letters on positions 1 and 5, we get a word "bcac".

Which least number of newspaper headings s₁ will Fangy need to glue them, erase several letters and get word s₂?

The input data contain two lines. The first line contain the heading s₁, the second line contains the word s₂. The lines only consist of lowercase Latin letters (1 ≤ |s₁| ≤ 10⁴, 1 ≤ |s₂| ≤ 10⁶).

If it is impossible to get the word s₂ in the above-described manner, print "-1" (without the quotes). Otherwise, print the least number of newspaper headings s₁, which Fangy will need to receive the word s₂.