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 Rust (1.15.1) (judge verdict: Time Limit Exceeded)

use std::cmp::{min,max};
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}
fn main(){
    let (n,m) = {
        let t = read_vec::<i64>();
        (t[0],t[1])
    };
    let s:Vec<char> = read::<String>().chars().collect();
    let t:Vec<char>  = read::<String>().chars().collect();
    let lcmv = lcm(n,m);
    let min = min(m,n);
    let max = max(n,m);
    let sv = create_vec(n,max, lcmv/n);
    let tv = create_vec(m,max, lcmv/m);
    // println!("{:?}",sv);
    // println!("{:?}",tv);
    if min == n{
        for (i,x) in sv.iter().enumerate(){
            // if t[*x as usize] != s[i] {println!("-1");return;}
            if tv.contains(&x){
                let j  = tv.iter().enumerate().find(|&(j,y)| *y == *x).unwrap().0;
                if s[i as usize] != t[j ] { println!("-1");return;}
            }
        }
    } else {
        for (i,x) in tv.iter().enumerate(){

            // if s[*x as usize] != t[i] {println!("-1");return;}
            if sv.contains(&x){
                // println!("{}",x);
                // println!("{:?}",sv);
                let j  = sv.iter().enumerate().find(|&(j,y)| *y == *x).unwrap().0;
                // println!("{}",j);
                if t[i as usize] != s[j ] { println!("-1");return;}
            }
        }
    }
    println!("{}",lcmv)
}

fn gcd(x:i64,y:i64)-> i64{
    if x % y == 0{
        y
    } else{
        gcd(y,x%y)
    }
}
fn lcm(x:i64,y:i64)->i64{
    x*y/gcd(x,y)
}
fn create_vec(x:i64,y:i64,diff:i64)->Vec<i64>{
    let mut v = vec![0];
    let mut count = 0;
    for j in 0..x-1{
        count += diff;
        // if count > y-1 {break};
        v.push(count);
    }
    v
}