Problem: Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year Eve (we Russians actually expect Santa for the New Year, not for Christmas). 

Vasya has come up with an algorithm he will follow while writing a letter. First he chooses two strings, s1 anf s2, consisting of uppercase English letters. Then the boy makes string sk, using a recurrent equation sn = sn - 2 + sn - 1, operation '+' means a concatenation (that is, the sequential record) of strings in the given order. Then Vasya writes down string sk on a piece of paper, puts it in the envelope and sends in to Santa. 

Vasya is absolutely sure that Santa will bring him the best present if the resulting string sk has exactly x occurrences of substring AC (the short-cut reminds him оf accepted problems). Besides, Vasya decided that string s1 should have length n, and string s2 should have length m. Vasya hasn't decided anything else.

At the moment Vasya's got urgent New Year business, so he asks you to choose two strings for him, s1 and s2 in the required manner. Help Vasya.

Input

The first line contains four integers k, x, n, m (3 ≤ k ≤ 50; 0 ≤ x ≤ 109; 1 ≤ n, m ≤ 100).

Output

In the first line print string s1, consisting of n uppercase English letters. In the second line print string s2, consisting of m uppercase English letters. If there are multiple valid strings, print any of them.

If the required pair of strings doesn't exist, print "Happy new year!" without the quotes.

Examples

Input

3 2 2 2


Output

AC
AC


Input

3 3 2 2


Output

Happy new year!


Input

3 0 2 2


Output

AA
AA


Input

4 3 2 1


Output

Happy new year!


Input

4 2 2 1


Output

Happy new year!

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int K, N, M;
long long X;
int st[2], ed[2], cnt[2];
long long f[55][4] = {0}, cnt1[55] = {0}, cnt2[55] = {0}, h[55] = {0},
          t[55] = {0}, g[55][4] = {0};
void init() {
  cnt1[1] = 1;
  cnt2[2] = 1;
  h[1] = 1;
  h[1] = t[1] = 1;
  h[2] = t[2] = 2;
  for (int i = 3; i <= K; i++) {
    if (t[i - 2] == 1 && h[i - 1] == 1) g[i][0]++;
    if (t[i - 2] == 1 && h[i - 1] == 2) g[i][1]++;
    if (t[i - 2] == 2 && h[i - 1] == 1) g[i][2]++;
    if (t[i - 2] == 2 && h[i - 1] == 2) g[i][3]++;
    for (int j = 0; j < 4; j++) g[i][j] += g[i - 2][j] + g[i - 1][j];
    h[i] = h[i - 2];
    t[i] = t[i - 1];
    cnt1[i] = cnt1[i - 1] + cnt1[i - 2];
    cnt2[i] = cnt2[i - 1] + cnt2[i - 2];
  }
}
void printans(int n, int o) {
  if (n & 1) {
    if (cnt[o] < n / 2) {
      putchar('A' - 1 + st[o]);
      for (int i = 1; i <= cnt[o]; i++) putchar('A'), putchar('C');
      for (int i = cnt[o] * 2 + 2; i < n; i++) putchar('B');
      putchar('A' - 1 + ed[o]);
    } else {
      if (st[o] == 1) {
        for (int i = 1; i <= cnt[o]; i++) putchar('A'), putchar('C');
        putchar('A' - 1 + ed[o]);
      } else {
        putchar('A' - 1 + st[o]);
        for (int i = 1; i <= cnt[o]; i++) putchar('A'), putchar('C');
      }
    }
  } else {
    if (cnt[o] < n / 2) {
      putchar('A' - 1 + st[o]);
      for (int i = 1; i <= cnt[o]; i++) putchar('A'), putchar('C');
      for (int i = cnt[o] * 2 + 2; i < n; i++) putchar('B');
      putchar('A' - 1 + ed[o]);
    } else {
      for (int i = 1; i <= cnt[o]; i++) putchar('A'), putchar('C');
    }
  }
}
void check() {
  long long num = 1ll * cnt1[K] * cnt[0] + 1ll * cnt2[K] * cnt[1];
  if (ed[0] == 1 && st[0] == 3) num += g[K][0];
  if (ed[0] == 1 && st[1] == 3) num += g[K][1];
  if (ed[1] == 1 && st[0] == 3) num += g[K][2];
  if (ed[1] == 1 && st[1] == 3) num += g[K][3];
  if (num == X) {
    printans(N, 0);
    putchar('\n');
    printans(M, 1);
    exit(0);
  }
}
void dfs2(int n) {
  if (n == 1) {
    cnt[1] = 0;
    for (int i = 1; i <= 3; i++) {
      st[1] = ed[1] = i;
      check();
    }
    return;
  }
  for (int i = 0; i <= n / 2; i++) {
    cnt[1] = i;
    if (i < n / 2) {
      for (int j = 1; j <= 3; j++)
        for (int k = 1; k <= 3; k++) {
          st[1] = j;
          ed[1] = k;
          check();
        }
    } else {
      if (n & 1) {
        for (int j = 1; j <= 3; j++) {
          st[1] = 1;
          ed[1] = j;
          if (n > 1 || n == 1 && j == 1) check();
          st[1] = j;
          ed[1] = 3;
          if (n > 1 || n == 1 && j == 3) check();
        }
      } else {
        st[1] = 1;
        ed[1] = 3;
        check();
      }
    }
  }
}
void dfs1(int n) {
  if (n == 1) {
    cnt[0] = 0;
    for (int i = 1; i <= 3; i++) {
      st[0] = ed[0] = i;
      dfs2(M);
    }
    return;
  }
  for (int i = 0; i <= n / 2; i++) {
    cnt[0] = i;
    if (i < n / 2) {
      for (int j = 1; j <= 3; j++) {
        for (int k = 1; k <= 3; k++) {
          st[0] = j;
          ed[0] = k;
          dfs2(M);
        }
      }
    } else {
      if (n & 1) {
        for (int j = 1; j <= 3; j++) {
          st[0] = 1;
          ed[0] = j;
          if ((n > 1) || ((n == 1) && j == 1)) dfs2(M);
          ed[0] = 3;
          st[0] = j;
          if ((n > 1) || ((n == 1) && j == 3)) dfs2(M);
        }
      } else {
        st[0] = 1;
        ed[0] = 3;
        dfs2(M);
      }
    }
  }
}
int main() {
  cin >> K >> X >> N >> M;
  init();
  dfs1(N);
  printf("Happy new year!\n");
  return 0;
}