Problem:
Score : 300 points

Problem Statement

You are given a string S of length N and another string T of length M.
These strings consist of lowercase English letters.

A string X is called a good string when the following conditions are all met:

Let L be the length of X. L is divisible by both N and M.

Concatenating the 1-st, (\frac{L}{N}+1)-th, (2 \times \frac{L}{N}+1)-th, ..., ((N-1)\times\frac{L}{N}+1)-th characters of X, without changing the order, results in S.

Concatenating the 1-st, (\frac{L}{M}+1)-th, (2 \times \frac{L}{M}+1)-th, ..., ((M-1)\times\frac{L}{M}+1)-th characters of X, without changing the order, results in T.

Determine if there exists a good string. If it exists, find the length of the shortest such string.

Constraints

1 \leq N,M \leq 10^5

S and T consist of lowercase English letters.

|S|=N

|T|=M

Input

Input is given from Standard Input in the following format:

N M
S
T

Output

If a good string does not exist, print -1; if it exists, print the length of the shortest such string.

Sample Input 1

3 2
acp
ae

Sample Output 1

6

For example, the string accept is a good string.
There is no good string shorter than this, so the answer is 6.

Sample Input 2

6 3
abcdef
abc

Sample Output 2

-1

Sample Input 3

15 9
dnsusrayukuaiia
dujrunuma

Sample Output 3

45

Solution in C (GCC 5.4.1) (judge verdict: Runtime Error)

#include <stdio.h>
#include <stdlib.h>
int koubaisu(int,int);

int main(void){
	/* code */
	long int n, m;
	int max,min, i, k, p1, p2, q1, q2, answer, err;
	char s[100000], t[100000];
	err=scanf("%ld %ld\n%s\n%s", &n, &m, s, t);
	if (err!=4) exit(1);
	for(i=0; s[i]!='\0'; ++i);
	if (i!=n) exit(1);
	for(i=0; t[i]!='\0'; ++i);
	if (i!=m) exit(1);
	if(n>=m){
		max=n;
		min=m;
	}else{
		max=m;
		min=n;
	}

	k=koubaisu(min,max);
	p1=k/n;
	q1=k/m;
	p2=0;
	q2=0;
	answer=k;
	while(q2<n&&p2<m){
		/* code */
		if (s[q2]!=t[p2]){
			answer = -1;
		}
		if(answer==-1) break;
		p2+=p1;
		q2+=q1;
	}
	printf("%d\n", answer);
	return answer;
}

int koubaisu(int n, int m){
	int k=n, l=m, answer;
	for (;;){
		/* code */
		while(k<l){
			k+=n;
		}
		if (k==l){
			answer=k;
			break;
		}else{
			l+=m;
		}
	}
	return answer;
}