#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int modinv(long long int k) { return power(k, MOD - 2, MOD); }
long long int fact(long long int n);
long long int nCr(long long int n, long long int k) {
  long long int C[n + 1][k + 1];
  long long int i, j;
  for (i = 0; i <= n; i++) {
    for (j = 0; j <= min(i, k); j++) {
      if (j == 0 || j == i)
        C[i][j] = 1;
      else
        C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]);
    }
  }
  return C[n][k];
}
long long int fact(long long int n) {
  long long int res = 1;
  for (long long int i = 2; i <= n; i++) res = res * i;
  return res;
}
struct node {
  int mn = 0, mx = 0;
};
void build(vector<int> arr, node* segtree, int start, int end, int TreeNode) {
  if (start == end) {
    segtree[TreeNode].mx = arr[start];
    segtree[TreeNode].mn = arr[start];
    return;
  }
  int mid = (start + end) / 2;
  build(arr, segtree, start, mid, 2 * TreeNode);
  build(arr, segtree, mid + 1, end, 2 * TreeNode + 1);
  segtree[TreeNode].mx =
      max(segtree[2 * TreeNode].mx, segtree[2 * TreeNode + 1].mx);
  segtree[TreeNode].mn =
      min(segtree[2 * TreeNode].mn, segtree[2 * TreeNode + 1].mn);
}
void updateLazy(node* segtree, int* lazy, int start, int end, int TreeNode,
                int left, int right, int inc) {
  if (start > end) return;
  if (lazy[TreeNode] != 0) {
    segtree[TreeNode].mx += lazy[TreeNode];
    segtree[TreeNode].mn += lazy[TreeNode];
    if (start != end) {
      lazy[2 * TreeNode] += lazy[TreeNode];
      lazy[2 * TreeNode + 1] += lazy[TreeNode];
    }
    lazy[TreeNode] = 0;
  }
  if (left > end || right < start) {
    return;
  }
  if (left <= start && end <= right) {
    segtree[TreeNode].mx += inc;
    segtree[TreeNode].mn += inc;
    if (start != end) {
      lazy[2 * TreeNode] += inc;
      lazy[2 * TreeNode + 1] += inc;
    }
    return;
  }
  int mid = (start + end) / 2;
  updateLazy(segtree, lazy, start, mid, 2 * TreeNode, left, right, inc);
  updateLazy(segtree, lazy, mid + 1, end, 2 * TreeNode + 1, left, right, inc);
  segtree[TreeNode].mx =
      max(segtree[2 * TreeNode].mx, segtree[2 * TreeNode + 1].mx);
  segtree[TreeNode].mn =
      min(segtree[2 * TreeNode].mn, segtree[2 * TreeNode + 1].mn);
}
node query(node* segtree, int* lazy, int start, int end, int TreeNode, int left,
           int right) {
  if (lazy[TreeNode] != 0) {
    segtree[TreeNode].mx += lazy[TreeNode];
    segtree[TreeNode].mn += lazy[TreeNode];
    if (start != end) {
      lazy[2 * TreeNode] += lazy[TreeNode];
      lazy[2 * TreeNode + 1] += lazy[TreeNode];
    }
    lazy[TreeNode] = 0;
  }
  node t;
  t.mx = INT_MIN;
  t.mn = INT_MAX;
  if (left > end || right < start) {
    return t;
  }
  if (left <= start && end <= right) {
    return segtree[TreeNode];
  }
  int mid = (start + end) / 2;
  node a1 = query(segtree, lazy, start, mid, 2 * TreeNode, left, right);
  node a2 = query(segtree, lazy, mid + 1, end, 2 * TreeNode + 1, left, right);
  t.mx = max(a1.mx, a2.mx);
  t.mn = min(a1.mn, a2.mn);
  return t;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  vector<pair<int, int> > p(m);
  int mx = 0, mn = INT_MAX;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < m; i++) cin >> p[i].first >> p[i].second;
  node* segtree = new node[4 * n];
  int* lazy = new int[4 * n];
  int diff = -1;
  vector<int> ans;
  for (int i = 0; i < n; i++) {
    node* segtree = new node[4 * n];
    int* lazy = new int[4 * n]{0};
    build(a, segtree, 0, n - 1, 1);
    vector<int> bv;
    for (int j = 0; j < m; j++) {
      if (p[j].first <= i + 1 && p[j].second >= i + 1) continue;
      bv.emplace_back(j + 1);
      updateLazy(segtree, lazy, 0, n - 1, 1, p[j].first - 1, p[j].second - 1,
                 -1);
    }
    node t = query(segtree, lazy, 0, n - 1, 1, 0, n - 1);
    if (t.mx - t.mn > diff) {
      diff = t.mx - t.mn;
      ans = bv;
    }
    delete segtree;
    delete lazy;
  }
  cout << diff << "\n" << ans.size() << "\n";
  for (auto i : ans) {
    cout << i << " ";
  }
  cout << "\n";
}
