#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 17, M = (1 << 16), INF = 1e18;

int n, m, a[N], v[N], w[N], b[M], sumv[M], sumw[M], dp[N][M], pre[N][M];

inline int lowbit(int x) {
  return x & (-x);
}

void print(int x, int y) {
  if (!x) {
    return ;
  }
  print(x - 1, y - pre[x][y]);
  vector<int> ans;
  for (int i = pre[x][y]; i; i -= lowbit(i)) {
    ans.push_back(b[lowbit(i)]);
  }
  cout << ans.size() << " ";
  for (auto cur : ans) {
    cout << cur + 1 << " ";
  }
  cout << "\n";
}

signed main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> v[i] >> w[i];
    b[(1 << i)] = i;
  }
  for (int i = 1; i < (1 << m); i++) {
    sumv[i] = sumv[i - lowbit(i)] + v[b[lowbit(i)]];
    sumw[i] = sumw[i - lowbit(i)] + w[b[lowbit(i)]];
  }
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j < (1 << m); j++) {
      dp[i][j] = -INF;
    }
  }
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    dp[i][0] = 0;
    for (int j = 1; j < (1 << m); j++) {
      dp[i][j] = max(dp[i][j], dp[i - 1][j]);
      for (int k = j; k; k = (k - 1) & j) {
        if (sumw[k] <= a[i] && dp[i - 1][j - k] + sumv[k] > dp[i][j]) {
          dp[i][j] = dp[i - 1][j - k] + sumv[k];
          pre[i][j] = k;
        }
      }
    }
  }
  int maxi = -INF, p;
  for (int i = 0; i < (1 << m); i++) {
    if (maxi < dp[n][i]) {
      maxi = dp[n][i];
      p = i;
    }
  }
  cout << maxi << "\n";
  print(n, p);
  return 0;
}
/*
0 2 5 7 7 9 12 14 2 4 7 9 9 11 14 16 3 5 8 10 10 12 15 17 5 7 10 12 12 14 17 19 1 3 6 8 8 10 13 15 3 5 8 10 10 12 15 17 4 6 9 11 11 13 16 18 6 8 11 13 13 15 18 20
0 2 5 7 7 9 12 14 2 4 7 9 9 11 14 16 3 5 8 10 10 12 15 17 5 7 10 12 12 14 17 19 0 2 5 7 7 9 12 14 2 4 7 9 9 11 14 16 3 5 8 10 10 12 15 17 5 7 10 12 12 14 17 19
*/