CF145B.Lucky Number 2

Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Petya loves long lucky numbers very much. He is interested in the minimum lucky number d that meets some condition. Let cnt(x) be the number of occurrences of number x in number d as a substring. For example, if d = 747747, then cnt(4) = 2, cnt(7) = 4, cnt(47) = 2, cnt(74) = 2. Petya wants the following condition to fulfil simultaneously: cnt(4) = _a_1, cnt(7) = _a_2, cnt(47) = _a_3, cnt(74) = _a_4. Petya is not interested in the occurrences of other numbers. Help him cope with this task.

佩佳非常喜欢幸运数字。众所周知，幸运数字是指十进制表示中仅包含幸运数字 4 和 7 的正整数。例如，47、744、4 是幸运数字，而 5、17、467 则不是。

佩佳尤其钟爱较长的幸运数字。他感兴趣的是满足某些条件的最小幸运数字 $ d $。令 $ \text{cnt}(x) $ 表示数字 $ x $ 作为子串在数字 $ d $ 中出现的次数。例如，若 $ d = 747747 $，则 $ \text{cnt}(4) = 2 $，$ \text{cnt}(7) = 4 $，$ \text{cnt}(47) = 2 $，$ \text{cnt}(74) = 2 $。佩佳希望同时满足以下条件：$ \text{cnt}(4) = a_1 $，$ \text{cnt}(7) = a_2 $，$ \text{cnt}(47) = a_3 $，$ \text{cnt}(74) = a_4 $。佩佳不关心其他数字的出现次数。请帮助他完成这项任务。

The single line contains four integers _a_1, _a_2, _a_3 and _a_4 (1 ≤ _a_1, _a_2, _a_3, _a_4 ≤ 106).

单行包含四个整数 $a_1$、$a_2$、$a_3$ 和 $a_4$（$1 \leq a_1, a_2, a_3, a_4 \leq 10^6$）。

On the single line print without leading zeroes the answer to the problem — the minimum lucky number d such, that cnt(4) = _a_1, cnt(7) = _a_2, cnt(47) = _a_3, cnt(74) = _a_4. If such number does not exist, print the single number "-1" (without the quotes).

在单行中输出问题的答案——满足条件的最小幸运数 $d$，使得 $cnt(4) = a_1$、$cnt(7) = a_2$、$cnt(47) = a_3$、$cnt(74) = a_4$。输出时不得有前导零。若不存在这样的数，则输出单个数字 “-1”（不带引号）。