#include<bits/stdc++.h>

using namespace std;

const int N = 20;
const long long INF = 5e10;
const int M = (1 << 16) + 5;

bool dp[N][M];
int n, m, v[N], w[N], b[M], p[M], pre[N][M];
long long a[N], maxx[M], numw[M], numv[M];

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

void print(int x, int state){
  if(!x) return ;
  print(x - 1, state - pre[x][state]);
  vector<int> ans;
  for(int i = pre[x][state]; i; i -= lowbit(i)) ans.push_back(b[lowbit(i)]);
  cout << ans.size() << ' ';
  sort(ans.begin(), ans.end());
  for(int v : ans) cout << v + 1 << ' ';
  cout << '\n';
}

void Solve(int x){
  for(int i = 0; i < (1 << m); i++) maxx[i] = -INF, p[i] = 0;
  for(int i = 0; i < (1 << m); i++){
    if(dp[x][i]) maxx[i] = max(maxx[i], a[x + 1]);
  }
  for(int i = 0; i < m; i++){
    for(int j = 0; j < (1 << m); j++){
      if(!((j >> i) & 1) && maxx[j + (1 << i)] < maxx[j] - w[i]){
        maxx[j + (1 << i)] = maxx[j] - w[i];
        p[j + (1 << i)] = p[j] + (1 << i);
      }
    }
  }
}

int 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++){
    numw[i] = numw[i - lowbit(i)] + w[b[lowbit(i)]];
    numv[i] = numv[i - lowbit(i)] + v[b[lowbit(i)]];
  }
  for(int i = 0; i <= n; i++){
    for(int j = 0; j < (1 << m); j++) dp[i][j] = 0;
  }
  dp[0][0] = 1;
  for(int i = 1; i <= n; i++){
    Solve(i - 1);
    for(int j = 0; j < (1 << m); j++){
      dp[i][j] |= dp[i - 1][j];
      if(!dp[i][j] && maxx[j] >= 0){
        dp[i][j] = 1;
        pre[i][j] = p[j];
      }
    }
  }
  int h = 0;
  for(int j = 1; j < (1 << m); j++){
    if(dp[n][j] && numv[j] > numv[h]) h = j;
  }
  cout << numv[h] << '\n';
  print(n, h);
  return 0;
}