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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

public class Main {
	int N, M;
	String S, T;
	int result = -1;

	private Main() {
		Scanner in = new Scanner(System.in);
		String[] tokens = in.nextLine().split(" ");
		N = Integer.parseInt(tokens[0]);
		M = Integer.parseInt(tokens[1]);
		if (N < M) {
			int temp = N;
			N = M;
			M = temp;
			T = in.nextLine();
			S = in.nextLine();
		} else {
			S = in.nextLine();
			T = in.nextLine();
		}
		in.close();
	}

	private void calc() {
		int saishouKoubai = saishouKoubai(N, M);
		if (N == M) {
			// 同じ長さ -> すべての要素が同じ
			if (S.equals(T)) {
				result = N;
			} else {
				result = -1;
			}
		} else if (saishouKoubai == N) {
			result = N;
			int step = N / M;
			for (int j = 0; j < step; ++j) {
				for (int i = 0; i < M; ++i) {
					if (S.charAt(i + j * M) != T.charAt(i)) {
						result = -1;
						break;
					}
				}
				if (result < 0) {
					break;
				}
			}
		} else {
			if (S.charAt(0) == T.charAt(0)) {
				result = saishouKoubai;
			} else {
				result = -1;
			}
		}
		return;

	}

	private void show() {
		System.out.println(result);
	}

	private int saishouKoubai(int large, int little) {
		if (large < little) {
			return saishouKoubai(little, large);
		}
		int saidaiKouyaku = gcd(large, little);
		return large / saidaiKouyaku * little;
	}

	private int gcd(int large, int little) {
		if (large < little) {
			return gcd(little, large);
		}
		if (large % little == 0) {
			return little;
		}
		return gcd(little, large % little);
	}

	public static void main(String[] args) {
		Main ins = new Main();
		ins.calc();
		ins.show();

	}

}