#include <bits/stdc++.h>
using namespace std;
using namespace std;
struct Edge {
  long long from, to, capacity, cost;
};
vector<vector<long long>> adj, cost, capacity;
const long long INF = 1e9;
void shortest_paths(long long n, long long v0, vector<long long>& d,
                    vector<long long>& p) {
  d.assign(n, INF);
  d[v0] = 0;
  vector<bool> inq(n, false);
  queue<long long> q;
  q.push(v0);
  p.assign(n, -1);
  while (!q.empty()) {
    long long u = q.front();
    q.pop();
    inq[u] = false;
    for (long long v : adj[u]) {
      if (capacity[u][v] > 0 && d[v] > d[u] + cost[u][v]) {
        d[v] = d[u] + cost[u][v];
        p[v] = u;
        if (!inq[v]) {
          inq[v] = true;
          q.push(v);
        }
      }
    }
  }
}
long long min_cost_flow(long long N, vector<Edge> edges, long long K,
                        long long s, long long t) {
  adj.assign(N, vector<long long>());
  cost.assign(N, vector<long long>(N, 0));
  capacity.assign(N, vector<long long>(N, 0));
  for (Edge e : edges) {
    adj[e.from].push_back(e.to);
    adj[e.to].push_back(e.from);
    cost[e.from][e.to] = e.cost;
    cost[e.to][e.from] = -e.cost;
    capacity[e.from][e.to] = e.capacity;
  }
  long long flow = 0;
  long long cost = 0;
  vector<long long> d, p;
  while (flow < K) {
    shortest_paths(N, s, d, p);
    if (d[t] == INF) break;
    long long f = K - flow;
    long long cur = t;
    while (cur != s) {
      f = min(f, capacity[p[cur]][cur]);
      cur = p[cur];
    }
    flow += f;
    cost += f * d[t];
    cur = t;
    while (cur != s) {
      capacity[p[cur]][cur] -= f;
      capacity[cur][p[cur]] += f;
      cur = p[cur];
    }
  }
  return cost;
}
vector<Edge> edges;
void AddEdge(long long from, long long to, long long cap, long long cost) {
  Edge e;
  e.from = from;
  e.to = to;
  e.capacity = cap;
  e.cost = cost;
  edges.push_back(e);
}
signed main() {
  long long n, p, s;
  cin >> n >> p >> s;
  for (long long i = 1; i <= n; i++) AddEdge(0, i, 1, 0);
  for (long long i = 1; i <= n; i++) {
    long long a;
    cin >> a;
    AddEdge(i, n + 1, 1, -a);
  }
  for (long long i = 1; i <= n; i++) {
    long long a;
    cin >> a;
    AddEdge(i, n + 2, 1, -a);
  }
  AddEdge(n + 1, n + 3, p, 0);
  AddEdge(n + 2, n + 3, s, 0);
  auto ans = min_cost_flow(n + 4, edges, 40000, 0, n + 3);
  vector<long long> P, S;
  for (long long i = 1; i <= n; i++) {
    if (capacity[i][n + 1] == 0) {
      assert(capacity[i][n + 2] != 0);
      P.push_back(i);
    }
    if (capacity[i][n + 2] == 0) {
      assert(capacity[i][n + 1] != 0);
      S.push_back(i);
    }
  }
  cout << -ans << '\n';
  for (auto x : P) cout << x << " ";
  cout << '\n';
  for (auto x : S) cout << x << " ";
  cout << '\n';
}
