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.lang.*;
import java.io.*;
import java.util.*;

class Main{
	public static void main(String args[]) throws Exception{
		FScanner sc=new FScanner();
		int[] num=sc.readIntL();
		int n=num[0];
		int m=num[1];
		String[] s=sc.readStringL("");
		String[] t=sc.readStringL("");
		int lc=lcm(n,m);
		Map<Integer,String> cans=new HashMap<Integer,String>();
		
		
		
		
		int idx=0;
		boolean slv=true;
		
		for(int i=0; i<n; i++){
			idx=(i*(lc/n))+1;
			cans.put(idx,s[i]);
			
		}
		
		for(int i=0; i<m; i++){
			idx=(i*(lc/m))+1;
			
			if(!cans.containsKey(idx) || cans.get(idx).equals(t[i])){
					cans.put(idx,t[i]);
			}else{
				cans.put(idx,"/");
				slv=false;
			}
		}
		/*for(int key: cans.keySet()){
			System.out.printf("%d:%s ",key,cans.get(key));
		}
		System.out.println("");*/
		System.out.println((slv==true)? lc: -1);
	}
	
	static int lcm(int a, int b){
		return a*b/gcd(a,b);
	}
	
	static int gcd(int a, int b){
		int c=0;
		if(a<b){
			int t=a;
			a=b;
			b=t;
		}
		while(b!=0){
			c=a%b;
			a=b;
			b=c;
		}
		return a;
	}

	static void disp(int[] data){
		for(int i=0; i<data.length; i++){
				System.out.printf("%d ",data[i]);
		}
			System.out.println();
	}
	
	static void disp(String[] data){
		for(int i=0; i<data.length; i++){
				System.out.printf("%s ",data[i]);
		}
			System.out.println();
	}
	
	static void disp(long[] data){
		for(int i=0; i<data.length; i++){
				System.out.printf("%d ",data[i]);
		}
			System.out.println();
	}
	
	static class FScanner{
		BufferedReader read=null;
		StringTokenizer tok=null;
		Scanner sc;
		FScanner() throws FileNotFoundException{
			sc=new Scanner(System.in);
		}
		boolean hasNextLine(){
			boolean has=true;
			if(!sc.hasNextLine()){
				has=false;
			}
			return has;
		}
		int readInt(){
			String buf=sc.nextLine();
			return Integer.parseInt(buf);
		}
		long readLong(){
			long i=Long.parseLong(sc.nextLine());
			return i;
		}
		int[] readIntL(){
			String[] buf=sc.nextLine().split(" ");
			int[] num=new int[buf.length];
			for(int i=0; i<buf.length; i++){
				num[i]=Integer.parseInt(buf[i]);
			}
			return num;
		}
		
		String readString(){
			return sc.nextLine();
		}
		String[] readStringL(String dlm){
			String[] s=sc.nextLine().split(dlm);
			return s;
		}
	}
}