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# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace Practice
{
    class Program
    {
        static void Main(string[] args)
        {
            SolveA();
            //SolveB();
            //SolveC();
            //SolveD();
        }
        private const long MOD = 1000000007;
        static void SolveA()
        {
            var nm = ReadAndParseIntArr();
            int n = nm[0];
            int m = nm[1];
            string s = Console.ReadLine();
            string t = Console.ReadLine();
            if(s[0] != t[0])
            {
                Console.WriteLine(-1);
                return;
            }
            if( n == m)
            {
                if( s == t)
                {
                    Console.WriteLine(n);
                }
                else
                {
                    Console.WriteLine(-1);
                }
                return;
            }

            long l = lcm(n, m);
            if( l <= 0)
            {
                Console.WriteLine(-1);
                return;
            }
            if(l < n || l < m)
            {
                Console.WriteLine(-1);
                return;
            }
            // 互いに素なら衝突しなさそう
            long ln = l / n;
            long lm = l / m;
            if( isPrime(ln) && isPrime(lm))
            {
                Console.WriteLine(l);
            }
            else
            {
                // 真面目に判定するか…
                char[] x = CreateDummyString(l, s);
                if( x == null)
                {
                    Console.WriteLine(-1);
                    return;
                }
                if (IsValid(l, t, x))
                {
                    Console.WriteLine(l);
                }
                else
                {
                    Console.WriteLine(-1);
                }
            }
        }
        private static char[] CreateDummyString(long l, string s)
        {
            long n = s.Length;
            long coef = l / n;
            var x = new char[l];
            for(long i =0;i<n;++i)
            {
                long idx = i * coef;
                if( idx < 0 || x.Length <= idx) { return null; }
                if(s.Length <= i) { return null; }
                x[idx] = s[(int)i];
            }
            return x;
        }
        private static bool IsValid(long l, string t, char[] x)
        {
            long m = t.Length;
            long coef = l / m;
            for(long i =0;i< m; ++i)
            {
                long idx =  i * coef;
                if( idx < 0 || x.Length <= idx) { return false; }
                if( x[idx] != 0 && x[idx] != t[(int)i]) { return false; }
            }
            return true;
        }
        private static bool isPrime(long x)
        {
            if( x == 2) { return true; }
            if( x < 2 || x % 2 == 0) { return false; }
            long i = 3;
            while( i * i <= x)
            {
                if( x % i == 0) { return false; }
                i = i + 2;
            }
            return true;
        }
        private static long lcm(long x, long y)
        {
            // todo オーバーフローしない？
            long g = gcd(x, y);
            if( g <= 0)
            {
                return -1;
            }
            return x  / g*y;
        }
        private static long gcd(long x, long y)
        {
            if(x < y)
            {
                long tmp = y;
                y = x;
                x = tmp;
            }
            while(y > 0)
            {
                long r = x % y;
                x = y;
                y = r;
            }
            return x;
        }

        private static int ReadAndParseInt()
        {
            return int.Parse(Console.ReadLine());
        }
        private static int[] ReadAndParseIntArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        }
        private static long ReadAndParseLong()
        {
            return long.Parse(Console.ReadLine());
        }
        private static long[] ReadAndParseLongArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
        }
    }
}