#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MAXN = 100100, MAXM = 310;
pair<int, int> a[MAXM];
int n, m, ans, v[MAXN];
vector<int> starting[MAXN], ending[MAXN];
set<int> st, vans;
struct no {
  int mn, l, r, lz = 0;
  no *fe, *fd;
  no(int l, int r, int v[]) : l(l), r(r) {
    if (l == r)
      mn = v[l];
    else {
      int mid = (l + r) >> 1;
      fe = new no(l, mid, v);
      fd = new no(mid + 1, r, v);
      mn = min(fe->mn, fd->mn);
    }
  }
  ~no() {
    if (l != r) delete fe, delete fd;
  }
  void refresh() {
    if (l != r) fe->lz += lz, fd->lz += lz;
    mn += lz, lz = 0;
  }
  int get(int a, int b) {
    if (b < l || a > r) return INF;
    refresh();
    if (a <= l && r <= b) return mn;
    return min(fe->get(a, b), fd->get(a, b));
  }
  void update(int a, int b, int x) {
    if (r < a || b < l) return;
    refresh();
    if (a <= l && r <= b) {
      lz += x;
      return;
    }
    fe->update(a, b, x), fd->update(a, b, x), fe->refresh(), fd->refresh();
    mn = min(fe->mn, fd->mn);
  }
};
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) cin >> v[i];
  no seg(1, n, v);
  for (int i = 1; i <= m; i++) {
    scanf("%d %d", &a[i].first, &a[i].second),
        seg.update(a[i].first, a[i].second, -1), st.insert(i);
    ending[a[i].second].push_back(i), starting[a[i].first].push_back(i);
  }
  for (int j = 1; j <= n; j++) {
    for (int i = 0; i < ending[j - 1].size(); i++)
      seg.update(a[ending[j - 1][i]].first, a[ending[j - 1][i]].second, -1),
          st.insert(ending[j - 1][i]);
    for (int i = 0; i < starting[j].size(); i++)
      seg.update(a[starting[j][i]].first, a[starting[j][i]].second, +1),
          st.erase(starting[j][i]);
    if (ans < v[j] - seg.get(1, n)) ans = v[j] - seg.get(1, n), vans = st;
  }
  printf("%d\n%d\n", ans, (int)vans.size());
  for (auto u : vans) printf("%d ", u);
}
