[2018-4-20]BNUZ套题比赛div2 A【补题】

CodeForces - 548A

While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string s.

He is not sure if this is his own back-bag or someone else's. He remembered that there were exactly k messages in his own bag, each was apalindrome string and all those strings had the same length.

He asked you to help him and tell him if he has worn his own back-bag. Check if the given strings is a concatenation of k palindromes of the same length.

Input

The first line of input contains string scontaining lowercase English letters (1 ≤ |s| ≤ 1000).

The second line contains integer k (1 ≤ k ≤ 1000).

Output

Print "YES"(without quotes) if he has worn his own back-bag or "NO"(without quotes) otherwise.

Examples

Input

saba
2

Output

NO

Input

saddastavvat
2

Output

YES

这道题真的是被题意坑死了，我以为只是Mike丢失的物品长度才是一样的，例如第二组样例中改成saddastabctavvat也是成立的TWT 真的是绝望

#include <stdio.h>
#include <string.h>

char ch[1010];

int pan(int start,int end) {
	int i,j;
	i=start;
	j=end;
	for(i,j; i<j; i++,j--) {
		if(ch[i]!=ch[j]) {
//			printf("%c %c",ch[i],ch[j]);
			return 0;
		}
	}
	return 1;
}

int main () {
	int n;
	memset(ch,'\0',sizeof(ch));
	scanf("%s %d",ch,&n);
	int len = strlen(ch);
//	printf("%d %d",len,n);
	if(len % n != 0) {
		printf("NO\n");
	} else {
		int t = 1;
		int k=len/n;
		for(int i=1; i<=n; i++) {
			t=pan(k*(i-1),k*i-1);
			if(t==0) {
				printf("NO\n");
				break;
			}
		}
		if(t==1) {
			printf("YES\n");
		}
	}


	return 0;
}