Problem: The only difference between easy and hard versions is a number of elements in the array.

You are given an array a consisting of n integers. The value of the i-th element of the array is a_i.

You are also given a set of m segments. The j-th segment is [l_j; r_j], where 1 ≤ l_j ≤ r_j ≤ n.

You can choose some subset of the given set of segments and decrease values on each of the chosen segments by one (independently). For example, if the initial array a = [0, 0, 0, 0, 0] and the given segments are [1; 3] and [2; 4] then you can choose both of them and the array will become b = [-1, -2, -2, -1, 0].

You have to choose some subset of the given segments (each segment can be chosen at most once) in such a way that if you apply this subset of segments to the array a and obtain the array b then the value max_{i=1}^{n}b_i - min_{i=1}^{n}b_i will be maximum possible.

Note that you can choose the empty set.

If there are multiple answers, you can print any.

If you are Python programmer, consider using PyPy instead of Python when you submit your code.

Input

The first line of the input contains two integers n and m (1 ≤ n ≤ 300, 0 ≤ m ≤ 300) — the length of the array a and the number of segments, respectively.

The second line of the input contains n integers a_1, a_2, ..., a_n (-10^6 ≤ a_i ≤ 10^6), where a_i is the value of the i-th element of the array a.

The next m lines are contain two integers each. The j-th of them contains two integers l_j and r_j (1 ≤ l_j ≤ r_j ≤ n), where l_j and r_j are the ends of the j-th segment.

Output

In the first line of the output print one integer d — the maximum possible value max_{i=1}^{n}b_i - min_{i=1}^{n}b_i if b is the array obtained by applying some subset of the given segments to the array a.

In the second line of the output print one integer q (0 ≤ q ≤ m) — the number of segments you apply.

In the third line print q distinct integers c_1, c_2, ..., c_q in any order (1 ≤ c_k ≤ m) — indices of segments you apply to the array a in such a way that the value max_{i=1}^{n}b_i - min_{i=1}^{n}b_i of the obtained array b is maximum possible.

If there are multiple answers, you can print any.

Examples

Input


5 4
2 -2 3 1 2
1 3
4 5
2 5
1 3


Output


6
2
1 4 


Input


5 4
2 -2 3 1 4
3 5
3 4
2 4
2 5


Output


7
2
3 2 


Input


1 0
1000000


Output


0
0

Note

In the first example the obtained array b will be [0, -4, 1, 1, 2] so the answer is 6.

In the second example the obtained array b will be [2, -3, 1, -1, 4] so the answer is 7.

In the third example you cannot do anything so the answer is 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline void readUI(int *i) {
  register int t = 0;
  register char z = getchar();
  while (z < '0' || '9' < z) {
    z = getchar();
  }
  while ('0' <= z && z <= '9') {
    t = (t << 1) + (t << 3) + z - '0';
    z = getchar();
  }
  *i = t;
}
inline void writeL(long long int l) {
  if (!l) {
    fprintf(stdout, "0\n");
    return;
  }
  bool wypisuj = false;
  long long int P = (1e18);
  while (P) {
    long long int liczba = (l / P);
    if (wypisuj || liczba) {
      wypisuj = true;
      fprintf(stdout, "%d", (int)liczba);
      liczba %= P;
    }
    P /= 10;
  }
}
int n, m, a, b, R, ile;
int tab[((int)(1e5) + 5)];
int wynik, poz, kier;
vector<pair<int, int> > lewy[((int)(1e5) + 5)], prawy[((int)(1e5) + 5)];
int tree[((1 << 18) + 5)], akt[((1 << 18) + 5)];
int inf = (1e9);
vector<int> odp;
void przepchnij(int x) {
  akt[x << 1] += akt[x];
  tree[x << 1] += akt[x];
  akt[x << 1 | 1] += akt[x];
  tree[x << 1 | 1] += akt[x];
  akt[x] = 0;
}
void insert(int x, int pp, int pk, int zp, int zk, int war) {
  if (pk < zp || zk < pp) {
    return;
  }
  if (zp <= pp && pk <= zk) {
    tree[x] += war;
    akt[x] += war;
    return;
  }
  int sr = ((pp + pk) >> 1);
  przepchnij(x);
  insert(x << 1, pp, sr, zp, zk, war);
  insert(x << 1 | 1, sr + 1, pk, zp, zk, war);
  tree[x] = min(tree[x << 1], tree[x << 1 | 1]);
}
int query(int x, int pp, int pk, int zp, int zk) {
  if (zk < pp || pk < zp) {
    return inf;
  }
  if (zp <= pp && pk <= zk) {
    return tree[x];
  }
  int sr = ((pp + pk) >> 1);
  przepchnij(x);
  return min(query(x << 1, pp, sr, zp, zk),
             query(x << 1 | 1, sr + 1, pk, zp, zk));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  R = 1;
  while (R < n) {
    R <<= 1;
  }
  for (int i = 1; i <= n; ++i) {
    cin >> tab[i];
  }
  for (int i = 1; i <= m; ++i) {
    cin >> a >> b;
    lewy[b + 1].emplace_back(make_pair(a, i));
    prawy[a - 1].emplace_back(make_pair(b, i));
  }
  for (int i = 1; i <= n; ++i) {
    int l = lewy[i].size();
    for (int j = 0; j < l; ++j) {
      insert(1, 1, R, lewy[i][j].first, i - 1, -1);
    }
    if (i > 1) {
      int gg = query(1, 1, R, 1, i - 1);
      if (0) {
        fprintf(stderr, "LEWO i=%d gg=%d\n", i, gg);
      }
      if (tab[i] - gg > wynik) {
        wynik = tab[i] - gg;
        poz = i;
        kier = 0;
      }
    }
    insert(1, 1, R, i, i, tab[i]);
  }
  for (int i = 1; i < (R << 1); ++i) {
    tree[i] = akt[i] = 0;
  }
  for (int i = n; i >= 1; --i) {
    int l = prawy[i].size();
    for (int j = 0; j < l; ++j) {
      insert(1, 1, R, i + 1, prawy[i][j].first, -1);
    }
    if (i < n) {
      int gg = query(1, 1, R, i + 1, n);
      if (tab[i] - gg > wynik) {
        wynik = tab[i] - gg;
        poz = i;
        kier = 1;
      }
    }
    insert(1, 1, R, i, i, tab[i]);
  }
  if (0) {
    fprintf(stderr, "wynik=%d poz=%d kier=%d\n", wynik, poz, kier);
  }
  fprintf(stdout, "%d\n", wynik);
  if (kier) {
    for (int i = n; i >= poz; --i) {
      int l = prawy[i].size();
      for (int j = 0; j < l; ++j) {
        odp.emplace_back(prawy[i][j].second);
      }
    }
  } else {
    for (int i = 1; i <= poz; ++i) {
      int l = lewy[i].size();
      for (int j = 0; j < l; ++j) {
        odp.emplace_back(lewy[i][j].second);
      }
    }
  }
  int l = odp.size();
  fprintf(stdout, "%d\n", l);
  for (int i = 0; i < l; ++i) {
    fprintf(stdout, "%d ", odp[i]);
  }
  return 0;
}