Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Permutation Cycle

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputFor a permutation *P*[1... *N*] of integers from 1 to *N*, function *f* is defined as follows:

Let *g*(*i*) be the minimum positive integer *j* such that *f*(*i*, *j*) = *i*. We can show such *j* always exists.

For given *N*, *A*, *B*, find a permutation *P* of integers from 1 to *N* such that for 1 ≤ *i* ≤ *N*, *g*(*i*) equals either *A* or *B*.

Input

The only line contains three integers *N*, *A*, *B* (1 ≤ *N* ≤ 10^{6}, 1 ≤ *A*, *B* ≤ *N*).

Output

If no such permutation exists, output -1. Otherwise, output a permutation of integers from 1 to *N*.

Examples

Input

9 2 5

Output

6 5 8 3 4 1 9 2 7

Input

3 2 1

Output

1 2 3

Note

In the first example, *g*(1) = *g*(6) = *g*(7) = *g*(9) = 2 and *g*(2) = *g*(3) = *g*(4) = *g*(5) = *g*(8) = 5

In the second example, *g*(1) = *g*(2) = *g*(3) = 1

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/20/2020 19:03:52 (e1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|