Problem: The 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 pi. At the same time there are m sockets available, the j-th of which has power euqal to positive integer sj. It is possible to connect the i-th computer to the j-th socket if and only if their powers are the same: pi = sj. 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 <image>, it means that it is equal to the socket's power divided by two with rounding up, for example <image> and <image>.

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 p1, p2, ..., pn (1 ≤ pi ≤ 109) — the powers of the computers. 

The third line contains m integers s1, s2, ..., sm (1 ≤ si ≤ 109) — 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 a1, a2, ..., am (0 ≤ ai ≤ 109), where ai equals the number of adapters orginizers need to plug into the i-th socket. The sum of all ai should be equal to u.

In third line print n integers b1, b2, ..., bn (0 ≤ bi ≤ m), where the bj-th equals the number of the socket which the j-th computer should be connected to. bj = 0 means that the j-th computer should not be connected to any socket. All bj that are different from 0 should be distinct. The power of the j-th computer should be equal to the power of the socket bj after plugging in abj adapters. The number of non-zero bj 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const int mod = 1000000007;
const double pi = acos(-1.0);
inline void gn(long long& x) {
  int sg = 1;
  char c;
  while (((c = getchar()) < '0' || c > '9') && c != '-')
    ;
  c == '-' ? (sg = -1, x = 0) : (x = c - '0');
  while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
  x *= sg;
}
inline void gn(int& x) {
  long long t;
  gn(t);
  x = t;
}
inline void gn(unsigned long long& x) {
  long long t;
  gn(t);
  x = t;
}
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
long long powmod(long long a, long long x, long long mod) {
  long long t = 1ll;
  while (x) {
    if (x & 1) t = t * a % mod;
    a = a * a % mod;
    x >>= 1;
  }
  return t;
}
const int maxn = 222222;
pair<int, int> pp[maxn];
map<int, int> need;
int fix[maxn];
map<int, vector<int> > hasid;
map<int, int> has;
int val[maxn];
int main() {
  int n, m;
  int totmatch = 0, totfix = 0;
  memset((fix), 0, sizeof(fix));
  gn(n);
  gn(m);
  for (int i = (1); i <= (n); i++) {
    int x;
    gn(x);
    need[x]++;
    val[i] = x;
  }
  for (int i = (1); i <= (m); i++) {
    int vv;
    gn(vv);
    pp[i].first = vv;
    pp[i].second = i;
  }
  sort(pp + 1, pp + 1 + m);
  for (int i = (1); i <= (m); i++) {
    int p = pp[i].first;
    p = p * 2;
    int tmp = -1;
    while (true) {
      if (p == 1) break;
      p = (p + 1) / 2;
      tmp++;
      if (need.count(p) && has[p] < need[p]) break;
    }
    if (need.count(p) && has[p] < need[p]) {
      totfix += tmp;
      fix[pp[i].second] = tmp;
      hasid[p].push_back(pp[i].second);
      totmatch++;
      has[p]++;
    }
  }
  printf("%d %d\n", totmatch, totfix);
  for (int i = (1); i <= (m); i++) printf("%d ", fix[i]);
  puts("");
  for (int i = (1); i <= (n); i++) {
    if (!need.count(val[i]))
      printf("0 ");
    else {
      if (hasid[val[i]].size() > 0) {
        printf("%d ", hasid[val[i]].back());
        hasid[val[i]].pop_back();
      } else {
        printf("%d ", 0);
      }
    }
  }
  puts("");
  return 0;
}