import java.util.Scanner; public class xxx {     public static void main(String[] args) {              Scanner sc = new Scanner(System.in);         int n = sc.nextInt();         int k = sc.nextInt();         int MAX = 0,MIN = 10001;         int MAXx = 0 ,MINy = 0;         int k1 = k;         int [][] num = new int[k][2];         int [] nu = new int[n];         for (int i = 0; i < n; i++) {             nu[i] = sc.nextInt();             MIN = MIN>nu[i]?nu[i]:MIN;             MAX = MAX<nu[i]?nu[i]:MAX;         }         if(MAX!=MIN){             while(k1-->0){                 for (int i = 0; i < n; i++) {                     if(MAX<=nu[i]){                         MAX = nu[i];                         MAXx = i;                     }                     if(MIN>=nu[i]){                         MIN = nu[i];                         MINy = i;                     }                 }                 if(MAX!=MIN){                                          MIN = --nu[MAXx];                     MAX = ++nu[MINy];                     num[k-(k1+1)][0] = MAXx+1;                     num[k-(k1+1)][1] = MINy+1;                                      }else{                     break;                 }             }             MAX = 0;             MIN = 10001;             for (int i = 0; i < n; i++) {                 MIN = MIN>nu[i]?nu[i]:MIN;                 MAX = MAX<nu[i]?nu[i]:MAX;             }             System.out.println((MAX-MIN)+" "+(k-(k1+1)));             for (int i = 0; i < k; i++) {                 System.out.println(num[i][0]+" "+num[i][1]);             }         }else{             System.out.println("0"+" "+"0");         }     } }