Passwords Codeforces Round#374-B

B. Passwords

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vanya is managed to enter his favourite site Codehorses. Vanya uses n distinct passwords for sites at all, however he can't remember which one exactly he specified during Codehorses registration.

Vanya will enter passwords in order of non-decreasing their lengths, and he will enter passwords of same length in arbitrary order. Just when Vanya will have entered the correct password, he is immediately authorized on the site. Vanya will not enter any password twice.

Entering any passwords takes one second for Vanya. But if Vanya will enter wrong password k times, then he is able to make the next try only 5 seconds after that. Vanya makes each try immediately, that is, at each moment when Vanya is able to enter password, he is doing that.

Determine how many seconds will Vanya need to enter Codehorses in the best case for him (if he spends minimum possible number of second) and in the worst case (if he spends maximum possible amount of seconds).

Input

The first line of the input contains two integers n and k (1 ≤ n, k ≤ 100) — the number of Vanya's passwords and the number of failed tries, after which the access to the site is blocked for 5 seconds.

The next n lines contains passwords, one per line — pairwise distinct non-empty strings consisting of latin letters and digits. Each password length does not exceed 100 characters.

The last line of the input contains the Vanya's Codehorses password. It is guaranteed that the Vanya's Codehorses password is equal to some of his n passwords.

Output

Print two integers — time (in seconds), Vanya needs to be authorized to Codehorses in the best case for him and in the worst case respectively.

Examples

input

5 2
cba
abc
bb1
abC
ABC
abc

output

1 15

input

4 100
11
22
1
2
22

output

3 4

Note

Consider the first sample case. As soon as all passwords have the same length, Vanya can enter the right password at the first try as well as at the last try. If he enters it at the first try, he spends exactly 1 second. Thus in the best case the answer is 1. If, at the other hand, he enters it at the last try, he enters another 4 passwords before. He spends 2 seconds to enter first 2 passwords, then he waits 5 seconds as soon as he made 2 wrong tries. Then he spends 2 more seconds to enter 2 wrong passwords, again waits 5 seconds and, finally, enters the correct password spending 1 more second. In summary in the worst case he is able to be authorized in 15 seconds.

Consider the second sample case. There is no way of entering passwords and get the access to the site blocked. As soon as the required password has length of 2, Vanya enters all passwords of length 1 anyway, spending 2 seconds for that. Then, in the best case, he immediately enters the correct password and the answer for the best case is 3, but in the worst case he enters wrong password of length 2 and only then the right one, spending 4 seconds at all.

水题 下面展示了两种计数的方式 一种模拟 一种直接计算（其实是我一开始脑抽了0.0Set也是。。抽了好几下就没改过来。。）

import java.io.*;
import java.util.*;
public class Main {
static class MyString implements Comparable{
	MyString(String s){
		string=s;
	}
	private String string;
	@Override
	public int compareTo(Object arg0) {
		MyString s=(MyString)arg0;
		if(this.string.length()<s.string.length()) return -1;
		else if(this.string.length()>s.string.length()) return 1;
		else{
			if(this.string.compareTo(s.string)<0) return -1;
			else return 1;
		}
	}
}
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			int n=sc.nextInt();
			int k=sc.nextInt();
			int min=0;
			int max=0;
			TreeSet<MyString>set=new TreeSet<MyString>();
			for(int i=1;i<=n;i++){
				set.add(new MyString(sc.next()));
			}
			String answer=sc.next();
			Iterator<MyString> i=set.iterator();
			int js=0;
			boolean flag1=false;
			//boolean flag2=false;
			int gs=0;
			if(set.first().string.length()==answer.length()){
				min=1;
				flag1=true;
			}
			while(i.hasNext()){
				MyString s=i.next();
				if(s.string.length()<=answer.length()){
					gs++;
				}
				if(flag1==false){
					if(s.string.length()==answer.length()){
						min++;
						flag1=true;
					}
					else{
						min++;
						js++;
						if(js==k){
							min=min+5;
							js=0;
						}
					}
				}
			}
			gs=gs-1;
			max=gs+gs/k*5+1;
			System.out.print(min+" "+max);
		}

	}

}

.