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: Wrong Answer)

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

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            Scanner cin = new Scanner();
            int N = cin.Int();
            int M = cin.Int();
            string S = Console.ReadLine();
            string T = Console.ReadLine();

            int n = N / GCD(N, M);
            int m = M / GCD(N, M);
            bool flag = true;
            for(int a = 0; a <= GCD(N, M) - 1; a++)
            {
                if (S[a * n] != T[a * m]) flag = false;
            }

            Console.WriteLine(flag ? LCM(N, M) : -1);
            Console.ReadLine();
        }

        static string GetNextPermutation(string pTarget)
        {
            var query = pTarget.ToCharArray().OrderBy(X => X);
            string BaseStr = "";
            foreach (char each in query)
            {
                BaseStr += each;
            }

            var stk = new Stack<string>();

            for (int I = 0; I <= BaseStr.Length - 1; I++)
            {
                stk.Push(BaseStr[I].ToString());
            }

            var answerList = new List<string>();

            while (stk.Count > 0)
            {
                string wkStr = stk.Pop();

                if (wkStr.Length == BaseStr.Length)
                {
                    answerList.Add(wkStr);
                    continue;
                }

                for (int I = 0; I <= BaseStr.Length - 1; I++)
                {
                    if (wkStr.Contains(BaseStr[I].ToString()) == false)
                    {
                        stk.Push(wkStr + BaseStr[I].ToString());
                    }
                }
            }

            foreach (string each in answerList.OrderBy(X => X))
            {
                if (pTarget.CompareTo(each) >= 0) continue;
                return each;
            }
            return pTarget;
        }

        static long Factorial(int n) //階乗
        {
            if (n == 1) return 1;
            return n * Factorial(n - 1);
        }

        static long Permutaion(int n, int k) //順列
        {
            long ans = 1;
            for (int i = 0; i < k; i++)
            {
                ans *= (n - i);
            }
            return ans;
        }

        static long Combination(int n, int k) //組み合わせ
        {
            long ans = 1;
            for (int i = n; i > n - k; --i)
            {
                ans = ans * i;
            }
            for (int i = 1; i < k + 1; ++i)
            {
                ans = ans / i;
            }
            return ans;
        }

        static int GCD(int a, int b) //a,bの最大公約数
        {
            if (a < b)
                // 引数を入替えて自分を呼び出す
                return GCD(b, a);
            while (b != 0)
            {
                var remainder = a % b;
                a = b;
                b = remainder;
            }
            return a;
        }

        static int LCM(int a, int b) //a,bの最小公倍数
        {
            return a / GCD(a, b) * b;
        }
    

        static int BinarySearch<T>(T[] array, T target) where T : IComparable<T> //2分探索
        {
            int min = 0;
            int max = array.Length - 1;

            while (true)
            {
                // 範囲内に見つからなかった
                if (max < min) return -1;
                // 範囲内の中央値と比較する
                int mid = min + (max - min) / 2;
                switch (target.CompareTo(array[mid]))
                {
                    case -1:    // 中央値より小さい
                        max = mid - 1;
                        break;
                    case 1:     // 中央値より大きい
                        min = mid + 1;
                        break;
                    case 0:     // 見つかった
                        return mid;
                }
            }
        }

        static void Swap<T>(ref T a, ref T b) //入れ替え
        {
            T tmp = a;
            a = b;
            b = tmp;
        }
    }

    class Scanner //標準入力
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int Int()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = Int() + add;
            }
            return Array;
        }

        public long Long()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = Long() + add;
            }
            return Array;
        }

        public double Double()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = Double() + add;
            }
            return Array;
        }
    }
}

/* Dictionaryのvalueが特定の値をとっている要素を削除する
var removeTargetLst = dic.Where(kv => kv.Value == value).ToList();
foreach(var item in removeTargetLst)
{
   dic.Remove(item.Key);
}
*/