#include <bits/stdc++.h>
using namespace std;
stringstream ss;
int n, k;
bool flag = false;
pair<int, int> arr[105];
int solve(int x) {
  if (x == 0) return 0;
  sort(arr, arr + n);
  if (arr[n - 1].first - arr[0].first <= 1) return x;
  arr[0].first++;
  arr[n - 1].first--;
  ss << arr[n - 1].second << " " << arr[0].second << endl;
  flag = true;
  return solve(x - 1);
}
int main() {
  cin >> n >> k;
  int temp;
  for (int a = 0; a < n; a++) {
    cin >> temp;
    arr[a].first = temp;
    arr[a].second = a + 1;
  }
  temp = solve(k);
  sort(arr, arr + n);
  cout << arr[n - 1].first - arr[0].first << " " << k - temp << endl;
  if (flag) cout << ss.str();
  return 0;
}
