#include<bits/stdc++.h>
using namespace std;
using ll = long long;

const int MAXN = 17;
const ll INF = (ll)(1e18);

int n, m, e[MAXN], v[MAXN], w[MAXN], f[MAXN][1 << 16], ans, pos;
ll V[1 << 16], W[1 << 16], dp[MAXN][1 << 16];

void Print(int x, int y) {
  if(!x) {
    return;
  }
  Print(x - 1, y ^ f[x][y]);
  cout << __builtin_popcount(f[x][y]) << " ";
  for(int i = 1; i <= m; ++i) {
    if((f[x][y] >> (i - 1)) & 1) {
      cout << i << " ";
    }
  }
  cout << "\n";
}

int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for(int i = 1; i <= n; ++i) {
    cin >> e[i];
  }
  for(int i = 1; i <= m; ++i) {
    cin >> v[i] >> w[i];
  }
  for(int i = 0; i < (1 << m); ++i) {
    for(int j = 1; j <= m; ++j) {
      V[i] += ((i >> (j - 1)) & 1) * v[j];
      W[i] += ((i >> (j - 1)) & 1) * w[j];
    }
  }
  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) {
    for(int j = 0; j < (1 << m); ++j) {
      for(int k = j; k >= 1; k = (k - 1) & j) {
        if(W[k] <= e[i] && dp[i][j] < dp[i - 1][j ^ k] + V[k]) {
          dp[i][j] = dp[i - 1][j ^ k] + V[k];
          f[i][j] = k;
        }
      }
      int k = 0;
      if(W[k] <= e[i] && dp[i][j] < dp[i - 1][j ^ k] + V[k]) {
        dp[i][j] = dp[i - 1][j ^ k] + V[k];
        f[i][j] = k;
      }
    }
  }
  for(int i = 0; i < (1 << m); ++i) {
    if(dp[n][i] > ans) {
      ans = dp[n][i], pos = i;
    }
  }
  cout << ans << "\n";
  Print(n, pos);
  return 0;
}