#include <bits/stdc++.h> using namespace std; const int Max = 2e4 + 4; int n, m, computer[Max]; struct Data{ int v, p; }x[Max], y[Max]; void Solutions() { cin >> n >> m; for (int i = 1; i <= n; ++i) { cin >> x[i].v; x[i].v++; x[i].p = i; } for (int i = 1; i <= m; ++i) { cin >> y[i].v; y[i].p = i; } sort(x + 1, x + n + 1, [](Data &z, Data &t) { return z.v < t.v; }); sort(y + 1, y + m + 1, [](Data &z, Data &t) { return z.v < t.v; }); int i = 1, j = 1, cnt = 0; memset(computer, 0, sizeof computer); while (i <= n && j <= m) { if (x[i].v <= y[j].v) { computer[x[i].p] = y[j].p; i++, j++, cnt++; } else ++j; } cout << cnt << '\n'; for (int i = 1; i <= n; ++i) cout << computer[i] << ' '; } int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); Solutions(); return 0; }