跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2427. Sereja and Periods

  • ID: 2433
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 二分
  • 搜索
  • 字符串
  • 算法思想
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Sereja and Periods

题目描述

B. Sereja and Periods
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Let's introduce the designation , where x is a string, n is a positive integer and operation "+" is the string concatenation operation. For example, [abc,2]=abcabc.

We'll say that string s can be obtained from string t, if we can remove some characters from string t and obtain string s. For example, strings ab and acba can be obtained from string xacbac, and strings bx and aaa cannot be obtained from it.

Sereja has two strings, w=[a,b] and q=[c,d]. He wants to find such maximum integer p (p>0), that [q,p] can be obtained from string w.

Input

The first line contains two integers b, d (1≤b,d≤107). The second line contains string a. The third line contains string c. The given strings are not empty and consist of lowercase English letters. Their lengths do not exceed 100.

Output

In a single line print an integer − the largest number p. If the required value of p doesn't exist, print 0.

Examples
Input
10 3
abab
bab
Output
3

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2057 题。保留原作者与原赛事署名。