Problem: There are n students at Berland State University. Every student has two skills, each measured as a number: ai — the programming skill and bi — the sports skill.

It is announced that an Olympiad in programming and sports will be held soon. That's why Berland State University should choose two teams: one to take part in the programming track and one to take part in the sports track.

There should be exactly p students in the programming team and exactly s students in the sports team. A student can't be a member of both teams.

The university management considers that the strength of the university on the Olympiad is equal to the sum of two values: the programming team strength and the sports team strength. The strength of a team is the sum of skills of its members in the corresponding area, so the strength of the programming team is the sum of all ai and the strength of the sports team is the sum of all bi over corresponding team members.

Help Berland State University to compose two teams to maximize the total strength of the university on the Olympiad.

Input

The first line contains three positive integer numbers n, p and s (2 ≤ n ≤ 3000, p + s ≤ n) — the number of students, the size of the programming team and the size of the sports team.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 3000), where ai is the programming skill of the i-th student.

The third line contains n positive integers b1, b2, ..., bn (1 ≤ bi ≤ 3000), where bi is the sports skill of the i-th student.

Output

In the first line, print the the maximum strength of the university on the Olympiad. In the second line, print p numbers — the members of the programming team. In the third line, print s numbers — the members of the sports team.

The students are numbered from 1 to n as they are given in the input. All numbers printed in the second and in the third lines should be distinct and can be printed in arbitrary order.

If there are multiple solutions, print any of them.

Examples

Input

5 2 2
1 3 4 5 2
5 3 2 1 4


Output

18
3 4 
1 5 


Input

4 2 2
10 8 8 3
10 7 9 4


Output

31
1 2 
3 4 


Input

5 3 1
5 2 5 1 7
6 3 1 6 3


Output

23
1 3 5 
4 

Solution (in JAVA):

Solution:
import java.util.*;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class I {
  public static class FastScanner {
  		BufferedReader br;
  		StringTokenizer st;

  		public FastScanner(String s) {
  			try {
  				br = new BufferedReader(new FileReader(s));
  			} catch (FileNotFoundException e) {
  				// TODO Auto-generated catch block
  				e.printStackTrace();
  			}
  		}

  		public FastScanner() {
  			br = new BufferedReader(new InputStreamReader(System.in));
  		}

  		String nextToken() {
  			while (st == null || !st.hasMoreElements()) {
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					// TODO Auto-generated catch block
  					e.printStackTrace();
  				}
  			}
  			return st.nextToken();
  		}

  		int nextInt() {
  			return Integer.parseInt(nextToken());
  		}

  		long nextLong() {
  			return Long.parseLong(nextToken());
  		}

  		double nextDouble() {
  			return Double.parseDouble(nextToken());
  		}
  	}
  static class Edge {
    int to, f, cap, cost, rev;

    Edge(int v, int cap, int cost, int rev) {
      this.to = v;
      this.cap = cap;
      this.cost = cost;
      this.rev = rev;
    }
  }

  public static List<Edge>[] createGraph(int n) {
    List<Edge>[] graph = new List[n];
    for (int i = 0; i < n; i++)
      graph[i] = new ArrayList<Edge>();
    return graph;
  }

  public static void addEdge(List<Edge>[] graph, int s, int t, int cap, int cost) {
    graph[s].add(new Edge(t, cap, cost, graph[t].size()));
    graph[t].add(new Edge(s, 0, -cost, graph[s].size() - 1));
  }

  static void bellmanFord(List<Edge>[] graph, int s, int[] dist, int[] prevnode, int[] prevedge, int[] curflow) {
    int n = graph.length;
    Arrays.fill(dist, 0, n, Integer.MAX_VALUE);
    dist[s] = 0;
    curflow[s] = Integer.MAX_VALUE;
    boolean[] inqueue = new boolean[n];
    int[] q = new int[n];
    int qt = 0;
    q[qt++] = s;
    for (int qh = 0; (qh - qt) % n != 0; qh++) {
      int u = q[qh % n];
      inqueue[u] = false;
      for (int i = 0; i < graph[u].size(); i++) {
        Edge e = graph[u].get(i);
        if (e.f >= e.cap)
          continue;
        int v = e.to;
        int ndist = dist[u] + e.cost;
        if (dist[v] > ndist) {
          dist[v] = ndist;
          prevnode[v] = u;
          prevedge[v] = i;
          curflow[v] = Math.min(curflow[u], e.cap - e.f);
          if (!inqueue[v]) {
            inqueue[v] = true;
            q[qt++ % n] = v;
          }
        }
      }
    }
  }

  public static int[] minCostFlow(List<Edge>[] graph, int s, int t, int maxf) {
    int n = graph.length;
    int[] dist = new int[n];
    int[] curflow = new int[n];
    int[] prevedge = new int[n];
    int[] prevnode = new int[n];

    int flow = 0;
    int flowCost = 0;
    while (flow < maxf) {
      bellmanFord(graph, s, dist, prevnode, prevedge, curflow);
      if (dist[t] == Integer.MAX_VALUE)
        break;
      int df = Math.min(curflow[t], maxf - flow);
      flow += df;
      for (int v = t; v != s; v = prevnode[v]) {
        Edge e = graph[prevnode[v]].get(prevedge[v]);
        e.f += df;
        graph[v].get(e.rev).f -= df;
        flowCost += df * e.cost;
      }
    }
    return new int[]{flow, flowCost};
  }

  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int n = sc.nextInt();
    int p = sc.nextInt();
    int s = sc.nextInt();

    List<Edge>[] graph = createGraph(n + 10);
    for(int i = 1;i <= n;i ++)
      addEdge(graph, 0 , i, 1, 0);
    for(int i = 1;i <= n;i ++)
    {
      int a = sc.nextInt();
      addEdge(graph, i , n + 1 , 1, -a);
    }
    for(int i = 1;i <= n;i ++)
    {
      int b = sc.nextInt();
      addEdge(graph, i , n + 2, 1 , -b);
    }
    addEdge(graph, n + 1, n + 3 , p, 0);
    addEdge(graph, n + 2, n + 3 , s, 0);

    int[] res = minCostFlow(graph, 0, n + 3, Integer.MAX_VALUE);
    int flow = res[0];
    int flowCost = res[1];
    System.out.println(-flowCost);
    for(int i = 1;i <= n;i ++)
    {
      for(int j = 0;j < graph[i].size();j ++)
      {
          Edge e = graph[i].get(j);
          if(e.to == n + 1 && e.f == 1)
          {
            System.out.print(i);
            System.out.print(" ");
          }
      }
    }
    System.out.println();
    for(int i = 1;i <= n;i ++)
    {
      for(int j = 0;j < graph[i].size();j ++)
      {
          Edge e = graph[i].get(j);
          if(e.to == n + 2 && e.f == 1)
          {
            System.out.print(i);
            System.out.print(" ");
          }
      }
    }
    System.out.println();

  }
}