Problem: An array b is called to be a subarray of a if it forms a continuous subsequence of a, that is, if it is equal to a_l, a_{l + 1}, …, a_r for some l, r.

Suppose m is some known constant. For any array, having m or more elements, let's define it's beauty as the sum of m largest elements of that array. For example: 

  * For array x = [4, 3, 1, 5, 2] and m = 3, the 3 largest elements of x are 5, 4 and 3, so the beauty of x is 5 + 4 + 3 = 12.
  * For array x = [10, 10, 10] and m = 2, the beauty of x is 10 + 10 = 20.



You are given an array a_1, a_2, …, a_n, the value of the said constant m and an integer k. Your need to split the array a into exactly k subarrays such that:

  * Each element from a belongs to exactly one subarray.
  * Each subarray has at least m elements.
  * The sum of all beauties of k subarrays is maximum possible.

Input

The first line contains three integers n, m and k (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ m, 2 ≤ k, m ⋅ k ≤ n) — the number of elements in a, the constant m in the definition of beauty and the number of subarrays to split to.

The second line contains n integers a_1, a_2, …, a_n (-10^9 ≤ a_i ≤ 10^9).

Output

In the first line, print the maximum possible sum of the beauties of the subarrays in the optimal partition.

In the second line, print k-1 integers p_1, p_2, …, p_{k-1} (1 ≤ p_1 < p_2 < … < p_{k-1} < n) representing the partition of the array, in which:

  * All elements with indices from 1 to p_1 belong to the first subarray.
  * All elements with indices from p_1 + 1 to p_2 belong to the second subarray.
  * ….
  * All elements with indices from p_{k-1} + 1 to n belong to the last, k-th subarray.



If there are several optimal partitions, print any of them.

Examples

Input


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


Output


21
3 5 

Input


6 1 4
4 1 3 2 2 3


Output


12
1 3 5 

Input


2 1 2
-1000000000 1000000000


Output


0
1 

Note

In the first example, one of the optimal partitions is [5, 2, 5], [2, 4], [1, 1, 3, 2].

  * The beauty of the subarray [5, 2, 5] is 5 + 5 = 10. 
  * The beauty of the subarray [2, 4] is 2 + 4 = 6. 
  * The beauty of the subarray [1, 1, 3, 2] is 3 + 2 = 5. 



The sum of their beauties is 10 + 6 + 5 = 21.

In the second example, one optimal partition is [4], [1, 3], [2, 2], [3].

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.StringTokenizer; 
			  
			
			public class temp4 {
				static class FastReader 
			    { 
			        BufferedReader br; 
			        StringTokenizer st; 
			  
			        public FastReader() 
			        { 
			            br = new BufferedReader(new
			                     InputStreamReader(System.in)); 
			        } 
			  
			        String next() 
			        { 
			            while (st == null || !st.hasMoreElements()) 
			            { 
			                try
			                { 
			                    st = new StringTokenizer(br.readLine()); 
			                } 
			                catch (IOException  e) 
			                { 
			                    e.printStackTrace(); 
			                } 
			            } 
			            return st.nextToken(); 
			        } 
			  
			        int nextInt() 
			        { 
			            return Integer.parseInt(next()); 
			        } 
			  
			        long nextLong() 
			        { 
			            return Long.parseLong(next()); 
			        } 
			  
			        double nextDouble() 
			        { 
			            return Double.parseDouble(next()); 
			        } 
			  
			        String nextLine() 
			        { 
			            String str = ""; 
			            try
			            { 
			                str = br.readLine(); 
			            } 
			            catch (IOException e) 
			            { 
			                e.printStackTrace(); 
			            } 
			            return str; 
			        } 
			    } 
				
			/*	static class Reader 
			    { 
			        final private int BUFFER_SIZE = 1 << 16; 
			        private DataInputStream din; 
			        private byte[] buffer; 
			        private int bufferPointer, bytesRead; 
			  
			        public Reader() 
			        { 
			            din = new DataInputStream(System.in); 
			            buffer = new byte[BUFFER_SIZE]; 
			            bufferPointer = bytesRead = 0; 
			        } 
			  
			        public Reader(String file_name) throws IOException 
			        { 
			            din = new DataInputStream(new FileInputStream(file_name)); 
			            buffer = new byte[BUFFER_SIZE]; 
			            bufferPointer = bytesRead = 0; 
			        } 
			  
			        public String readLine() throws IOException 
			        { 
			            byte[] buf = new byte[64]; // line length 
			            int cnt = 0, c; 
			            while ((c = read()) != -1) 
			            { 
			                if (c == '\n') 
			                    break; 
			                buf[cnt++] = (byte) c; 
			            } 
			            return new String(buf, 0, cnt); 
			        } 
			  
			        public int nextInt() throws IOException 
			        { 
			            int ret = 0; 
			            byte c = read(); 
			            while (c <= ' ') 
			                c = read(); 
			            boolean neg = (c == '-'); 
			            if (neg) 
			                c = read(); 
			            do
			            { 
			                ret = ret * 10 + c - '0'; 
			            }  while ((c = read()) >= '0' && c <= '9'); 
			  
			            if (neg) 
			                return -ret; 
			            return ret; 
			        } 
			  
			        public long nextLong() throws IOException 
			        { 
			            long ret = 0; 
			            byte c = read(); 
			            while (c <= ' ') 
			                c = read(); 
			            boolean neg = (c == '-'); 
			            if (neg) 
			                c = read(); 
			            do { 
			                ret = ret * 10 + c - '0'; 
			            } 
			            while ((c = read()) >= '0' && c <= '9'); 
			            if (neg) 
			                return -ret; 
			            return ret; 
			        } 
			  
			        public double nextDouble() throws IOException 
			        { 
			            double ret = 0, div = 1; 
			            byte c = read(); 
			            while (c <= ' ') 
			                c = read(); 
			            boolean neg = (c == '-'); 
			            if (neg) 
			                c = read(); 
			  
			            do { 
			                ret = ret * 10 + c - '0'; 
			            } 
			            while ((c = read()) >= '0' && c <= '9'); 
			  
			            if (c == '.') 
			            { 
			                while ((c = read()) >= '0' && c <= '9') 
			                { 
			                    ret += (c - '0') / (div *= 10); 
			                } 
			            } 
			  
			            if (neg) 
			                return -ret; 
			            return ret; 
			        } 
			  
			        private void fillBuffer() throws IOException 
			        { 
			            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
			            if (bytesRead == -1) 
			                buffer[0] = -1; 
			        } 
			  
			        private byte read() throws IOException 
			        { 
			            if (bufferPointer == bytesRead) 
			                fillBuffer(); 
			            return buffer[bufferPointer++]; 
			        } 
			  
			        public void close() throws IOException 
			        { 
			            if (din == null) 
			                return; 
			            din.close(); 
			        } 
			    } */
				static class Print
			{
				    private final BufferedWriter bw;
				    public Print()
				    {
				        bw=new BufferedWriter(new OutputStreamWriter(System.out));
				    }
			    public void print(String str)throws IOException
				    {
				        bw.append(str);
				    }
				    public void println(String str)throws IOException
				    {
				        print(str);
				        bw.append("\n");
				    }
				    public void close()throws IOException
				    {
				        bw.close();
				    }} 
					
					
				
					public static void main(String[] args) throws IOException {			
						FastReader scn=new FastReader();
						Print pr=new Print();
						int n=scn.nextInt(),m=scn.nextInt(),k=scn.nextInt();
						ArrayList<node> arr=new ArrayList<>();
						for(int i=0;i<n;i++){
							arr.add(new node(scn.nextInt(),i+1));
						}
						Collections.sort(arr,new Comparator<node>(){
							public int compare(node a,node b){
								if(a.a!=b.a)return b.a-a.a;
								else return b.b-a.b;
							}
						});
						ArrayList<Integer> idx=new ArrayList<>();
						long ans=0;
						for(int i=0;i<k*m;i++){
							ans+=arr.get(i).a;
							idx.add(arr.get(i).b);
						}
						Collections.sort(idx);
						pr.println(ans+"");
						for(int i=1;i<k;i++){
							pr.print(idx.get(i*m-1)+" ");
						}
						
						pr.close();
					}
					
			
					public static class node{
						int a;
						int b;
						public node(int a,int b){
							this.a=a;this.b=b;
						}
					}
					
			}