#include<bits/stdc++.h>

using namespace std;

using LL = long long;

LL w2[(1 << 17)][20], ans;
int w[20], n, m, e[20], v[20], id;
vector<int>ev;
LL dp[20][(1 << 17)], pre[20][(1 << 17)];

void dfs(int x, int s, LL sw, LL sum){
  if(x == m){
    for(int j = 1; j <= n; ++j){
      if(e[j] >= sw){
        w2[s][j] = sum;
      }
    }
    return;
  }
  dfs(x + 1, s, sw, sum);
  dfs(x + 1, (s | (1 << x)), sw + w[x], sum + v[x]);
}

void Dfs(int x, int s){
  if(!x)return;
  Dfs(x - 1, (s ^ pre[x][s]));
  ev.clear();
  for(int j = 0; j < m; ++j){
    if(pre[x][s] & (1 << j)){
      ev.push_back(j + 1);
    }
  }
  cout << ev.size() << ' ';
  for(auto v : ev){
    cout << v << ' ';
  }
  cout << '\n';
}

int main(){
  cin >> n >> m;
  for(int i = 1; i <= n; ++i){
    cin >> e[i];
    for(int j = 0; j < (1 << m); j++){
      w2[j][i] = -1e18;
    }
  }
  for(int j = 0; j < m; ++j){
    cin >> v[j] >> w[j];
  }
  dfs(0, 0, 0, 0);
  for(int i = 1; i <= n; ++i){
    for(int j = 0; j < (1 << m); j++){
      if(dp[i - 1][j] > dp[i][j]){
        dp[i][j] = dp[i - 1][j];
        pre[i][j] = 0;
      }
      for(int s = (((1 << m) - 1) ^ j); s; s = ((s - 1) & (((1 << m) - 1) ^ j))){
        if(dp[i - 1][j] + w2[s][i] > dp[i][j | s]){
          dp[i][j | s] = dp[i - 1][j] + w2[s][i];
          pre[i][j | s] = s;
        }
      }
    }
  }
  for(int i = 0; i < (1 << m); i++){
    if(dp[n][i] > ans){
      ans = dp[n][i];
      id = i;
    }
  }
  cout << dp[n][id] << '\n';
  Dfs(n, id);
  return 0;
}