You are given the string s of length n and the numbers p, q. Split the string s to pieces of length p and q.

For example, the string "Hello" for p = 2, q = 3 can be split to the two strings "Hel" and "lo" or to the two strings "He" and "llo".

Note it is allowed to split the string s to the strings only of length p or to the strings only of length q (see the second sample test).

Input

The first line contains three positive integers n, p, q (1 ≤ p, q ≤ n ≤ 100).

The second line contains the string s consists of lowercase and uppercase latin letters and digits.

Output

If it's impossible to split the string s to the strings of length p and q print the only number "-1".

Otherwise in the first line print integer k — the number of strings in partition of s.

Each of the next k lines should contain the strings in partition. Each string should be of the length p or q. The string should be in order of their appearing in string s — from left to right.

If there are several solutions print any of them.

Examples

Input

5 2 3
Hello


Output

2
He
llo


Input

10 9 5
Codeforces


Output

2
Codef
orces


Input

6 4 5
Privet


Output

-1


Input

8 1 1
abacabac


Output

8
a
b
a
c
a
b
a
c
import java.util.Scanner;

public class A {
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int length = in.nextInt();
    int p = in.nextInt();
    int q = in.nextInt();

    in.nextLine();

    String word = in.next();
    char[] charWord = word.toCharArray();

    if (checkOnSplitByOneValue(p, charWord)) return;
    if (checkOnSplitByOneValue(q, charWord)) return;

    if (checkOnSplitByTwoValue(p, q, charWord)) return;

    System.out.println("-1");
  }

  private static boolean checkOnSplitByTwoValue(int p, int q, char[] charWord) {
    int tempLength = charWord.length;
    int coutP = 0;
    while (tempLength - p > 0) {
      tempLength = tempLength - p;
      ++coutP;
      if (tempLength % q == 0) {
        int coutQ = tempLength / q;
        outputSplitWordOn(charWord, coutP, p, coutQ, q);
        return true;
      }
    }
    return false;
  }

  private static boolean checkOnSplitByOneValue(int value, char[] charWord) {
    int length = charWord.length;
    if (length % value == 0) {
      outputSplitWordOn(charWord, length / value, value, 0, 0);
      return true;
    }
    return false;
  }

  private static void outputSplitWordOn(char[] charWord, int countP, int p, int countQ, int q) {
    System.out.println(countP + countQ);
    int i = 0;
    for (; i < countP*p; i++) {
      if (i % p == 0 && i > 0) {
        System.out.println();
      }
      System.out.print(charWord[i]);
    }
    System.out.println();
    for (int j = 0; j < countQ*q; i++, j++) {
      if (j % q == 0 && j > 0) {
        System.out.println();
      }
      System.out.print(charWord[i]);
    }
  }
}
