#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int a[N];
vector<pair<int, int> > V;
int main() {
  int n, k;
  while (cin >> n >> k) {
    for (int i = 0; i < n; i++) {
      scanf("%d", a + i);
    }
    V.clear();
    int mx, mi, mxj, mij;
    for (int i = 0; i <= k; i++) {
      mx = mi = a[0];
      mxj = mij = 0;
      for (int j = 0; j < n; j++) {
        if (a[j] > mx) {
          mx = a[j], mxj = j;
        }
        if (a[j] < mi) {
          mi = a[j], mij = j;
        }
      }
      if (i == k) break;
      if (mx < mi + 2) break;
      a[mxj]--;
      a[mij]++;
      V.push_back(make_pair(mxj + 1, mij + 1));
    }
    cout << mx - mi << ' ' << V.size() << endl;
    for (int i = 0, sz = V.size(); i < sz; i++) {
      printf("%d %d\n", V[i].first, V[i].second);
    }
  }
  return 0;
}
