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

The problem statement has recently been changed. View the changes.

×
E. Sockets

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe ICM ACPC World Finals is coming! Unfortunately, the organizers of the competition were so busy preparing tasks that totally missed an important technical point — the organization of electricity supplement for all the participants workstations.

There are *n* computers for participants, the *i*-th of which has power equal to positive integer *p*_{i}. At the same time there are *m* sockets available, the *j*-th of which has power euqal to positive integer *s*_{j}. It is possible to connect the *i*-th computer to the *j*-th socket if and only if their powers are the same: *p*_{i} = *s*_{j}. It is allowed to connect no more than one computer to one socket. Thus, if the powers of all computers and sockets are distinct, then no computer can be connected to any of the sockets.

In order to fix the situation professor Puch Williams urgently ordered a wagon of adapters — power splitters. Each adapter has one plug and one socket with a voltage divider between them. After plugging an adapter to a socket with power *x*, the power on the adapter's socket becomes equal to , it means that it is equal to the socket's power divided by two with rounding up, for example and .

Each adapter can be used only once. It is possible to connect several adapters in a chain plugging the first to a socket. For example, if two adapters are plugged one after enother to a socket with power 10, it becomes possible to connect one computer with power 3 to this socket.

The organizers should install adapters so that it will be possible to supply with electricity the maximum number of computers *c* at the same time. If there are several possible connection configurations, they want to find the one that uses the minimum number of adapters *u* to connect *c* computers.

Help organizers calculate the maximum number of connected computers *c* and the minimum number of adapters *u* needed for this.

The wagon of adapters contains enough of them to do the task. It is guaranteed that it's possible to connect at least one computer.

Input

The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 200 000) — the number of computers and the number of sockets.

The second line contains *n* integers *p*_{1}, *p*_{2}, ..., *p*_{n} (1 ≤ *p*_{i} ≤ 10^{9}) — the powers of the computers.

The third line contains *m* integers *s*_{1}, *s*_{2}, ..., *s*_{m} (1 ≤ *s*_{i} ≤ 10^{9}) — the power of the sockets.

Output

In the first line print two numbers *c* and *u* — the maximum number of computers which can at the same time be connected to electricity and the minimum number of adapters needed to connect *c* computers.

In the second line print *m* integers *a*_{1}, *a*_{2}, ..., *a*_{m} (0 ≤ *a*_{i} ≤ 10^{9}), where *a*_{i} equals the number of adapters orginizers need to plug into the *i*-th socket. The sum of all *a*_{i} should be equal to *u*.

In third line print *n* integers *b*_{1}, *b*_{2}, ..., *b*_{n} (0 ≤ *b*_{i} ≤ *m*), where the *b*_{j}-th equals the number of the socket which the *j*-th computer should be connected to. *b*_{j} = 0 means that the *j*-th computer should not be connected to any socket. All *b*_{j} that are different from 0 should be distinct. The power of the *j*-th computer should be equal to the power of the socket *b*_{j} after plugging in *a*_{bj} adapters. The number of non-zero *b*_{j} should be equal to *c*.

If there are multiple answers, print any of them.

Examples

Input

2 2

1 1

2 2

Output

2 2

1 1

1 2

Input

2 1

2 100

99

Output

1 6

6

1 0

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/21/2021 11:11:30 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|