#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int INF = 1e9;
const double EPS = 1e-8;
struct Edge {
  int from, to, cap, flow, cost;
};
struct MCMF {
  int n, m;
  vector<Edge> edges;
  vector<int> G[3005];
  int inq[3005];
  int d[3005];
  int p[3005];
  int a[3005];
  void init(int n) {
    this->n = n;
    for (int i = 0; i < n; i++) G[i].clear();
    edges.clear();
  }
  void add_edge(int from, int to, int cap, int cost) {
    edges.push_back((Edge){from, to, cap, 0, cost});
    edges.push_back((Edge){to, from, 0, 0, -cost});
    m = edges.size();
    G[from].push_back(m - 2);
    G[to].push_back(m - 1);
  }
  bool BellmanFord(int s, int t, int& flow, int& ans) {
    for (int i = 0; i < n; i++) d[i] = INF;
    memset(inq, 0, sizeof(inq));
    d[s] = 0;
    inq[s] = 1;
    p[s] = 0;
    a[s] = INF;
    queue<int> Q;
    Q.push(s);
    while (!Q.empty()) {
      int u = Q.front();
      Q.pop();
      inq[u] = 0;
      for (int i = 0; i < G[u].size(); i++) {
        Edge& e = edges[G[u][i]];
        if (e.cap > e.flow && d[e.to] > d[u] + e.cost) {
          d[e.to] = d[u] + e.cost;
          p[e.to] = G[u][i];
          a[e.to] = min(a[u], e.cap - e.flow);
          if (!inq[e.to]) {
            Q.push(e.to);
            inq[e.to] = 1;
          }
        }
      }
    }
    if (d[t] == INF) return false;
    flow += a[t];
    ans += d[t] * a[t];
    int u = t;
    while (u != s) {
      edges[p[u]].flow += a[t];
      edges[p[u] ^ 1].flow -= a[t];
      u = edges[p[u]].from;
    }
    return true;
  }
  int Mincost(int s, int t) {
    int flow = 0;
    int cost = 0;
    while (BellmanFord(s, t, flow, cost))
      ;
    return cost;
  }
} mcmf;
vector<int> a1, a2;
int main() {
  int nn, x, y;
  while (cin >> nn >> x >> y) {
    MCMF a;
    a1.clear();
    a2.clear();
    int s = 0, p1 = nn + 1, p2 = nn + 2, t = nn + 3;
    a.n = t + 1;
    for (int i = 1; i <= nn; i++) {
      a.add_edge(0, i, 1, 0);
    }
    for (int i = 1; i <= nn; i++) {
      int num;
      scanf("%d", &(num));
      a.add_edge(i, p1, 1, -num);
    }
    for (int i = 1; i <= nn; i++) {
      int num;
      scanf("%d", &(num));
      a.add_edge(i, p2, 1, -num);
    }
    a.add_edge(p1, t, x, 0);
    a.add_edge(p2, t, y, 0);
    int ans = a.Mincost(s, t);
    cout << ans * (-1) << endl;
    for (int u = 1; u <= nn; u++) {
      for (int i = 0; i < a.G[u].size(); i++) {
        Edge e = a.edges[a.G[u][i]];
        if (!e.flow) continue;
        if (e.to == p1) a1.push_back(u);
        if (e.to == p2) a2.push_back(u);
      }
    }
    int sz = a1.size();
    for (int i = 0; i < sz; i++) {
      printf("%d%c", a1[i], (i == sz - 1 ? '\n' : ' '));
    }
    sz = a2.size();
    for (int i = 0; i < sz; i++) {
      printf("%d%c", a2[i], (i == sz - 1 ? '\n' : ' '));
    }
  }
}
