Olympiad in Programming and Sports

Description:

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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 3000), where a_i is the programming skill of the i-th student.

The third line contains n positive integers b₁, b₂, ..., b_n (1 ≤ b_i ≤ 3000), where b_i 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.

Sample Input:

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

Sample Output:

18
3 4 
1 5 

Sample Input:

4 2 2
10 8 8 3
10 7 9 4

Sample Output:

31
1 2 
3 4 

Sample Input:

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

Sample Output:

23
1 3 5 
4