#include <bits/stdc++.h>
#pragma GCC target("sse2")
#pragma GCC optimization("O2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize "trapv"
using namespace std;
const int maxn = 1000500;
inline int g() {
  int x;
  cin >> x;
  return x;
}
inline long long gl() {
  long long x;
  cin >> x;
  return x;
}
inline char gc() {
  char x;
  cin >> x;
  return x;
}
inline string gs() {
  string s;
  cin >> s;
  return s;
}
template <typename T>
inline vector<T> gv(int len) {
  vector<T> a(len);
  for (auto &it : a) cin >> it;
  return a;
}
inline vector<int> gv(int len) {
  vector<int> a(len);
  for (auto &it : a) cin >> it;
  return a;
}
inline vector<pair<int, int>> gv_andPairCnt(int len) {
  vector<pair<int, int>> a(len);
  int i = 1;
  for (auto &it : a) {
    it.second = i;
    i++;
    cin >> it.first;
  }
  return a;
}
double power_log(double power, double val) { return log(val) / log(power); }
template <typename T>
T sqr(T x) {
  return x * x;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto it : v) os << it << ", ";
  os << "\n";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &v) {
  os << "deque:{";
  for (auto it : v) os << it << " ";
  os << "}\n";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "set:{";
  for (auto it : v) os << it << " ";
  os << "}";
  return os;
}
template <typename T, typename T2>
ostream &operator<<(ostream &os, const map<T, T2> &v) {
  os << "map:{\n";
  for (auto it : v) os << "    {" << it.first << " <> " << it.second << "}\n";
  os << "}\n";
  return os;
}
template <typename T, typename T2>
ostream &operator<<(ostream &os, const pair<T, T2> &v) {
  os << "{" << v.first << ", " << v.second << "}";
  return os;
}
template <typename T, typename H>
inline vector<pair<T, H>> gv_andBiPair(int len) {
  vector<pair<T, H>> a(len);
  for (auto &it : a) {
    cin >> it.first >> it.second;
  }
  return a;
}
template <typename T>
inline set<T> vector_to_set(const vector<T> &vec) {
  set<T> s;
  for (auto &it : vec) s.insert(it);
  return s;
}
const long long md = 1e9 + 7;
vector<int> arr[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n = g(), m = g();
  vector<int> pref(maxn), suf(maxn), a(maxn);
  vector<pair<int, int>> sgs(maxn);
  for (int i = 1; i <= n; i++) {
    a[i] = g();
  }
  pref[1] = a[1];
  suf[n] = a[n];
  for (int i = 2; i <= n; i++) {
    pref[i] = max(pref[i - 1], a[i]);
  }
  for (int i = n - 1; i >= 1; i--) {
    suf[i] = max(suf[i + 1], a[i]);
  }
  for (int i = 1; i <= m; i++) {
    int l = g(), r = g();
    arr[l].push_back(i);
    arr[r + 1].push_back(-i);
    sgs[i] = make_pair(l, r);
  }
  int ans = *max_element(a.begin() + 1, a.begin() + 1 + n) -
            *min_element(a.begin() + 1, a.begin() + 1 + n);
  vector<int> ans2;
  vector<int> tmp;
  set<pair<int, int>> left, right;
  for (int i = 1; i <= n; i++) {
    for (auto it : arr[i]) {
      if (it > 0) {
        left.insert({sgs[it].first, it});
        right.insert({sgs[it].second, it});
      } else {
        it = abs(it);
        left.erase({sgs[it].first, it});
        right.erase({sgs[it].second, it});
      }
    }
    tmp.clear();
    for (auto it : right) {
      tmp.push_back(it.second);
      if (it.first + 1 > n) {
        continue;
      }
      int t = suf[it.first + 1] - (a[i] - (int)tmp.size());
      if (ans < t) {
        ans = t;
        ans2 = tmp;
      }
    }
    tmp.clear();
    for (auto it = left.rbegin(); it != left.rend(); it++) {
      tmp.push_back(it->second);
      if ((it->first) - 1 < 1) {
        continue;
      }
      int t = pref[(it->first) - 1] - (a[i] - (int)tmp.size());
      if (ans < t) {
        ans = t;
        ans2 = tmp;
      }
    }
  }
  cout << ans << "\n" << ans2.size() << "\n";
  for (auto &it : ans2) {
    cout << it << " ";
  }
}
