#include <bits/stdc++.h>
#define _1 (__int128)1

using namespace std;
using ll = long long;

void FileIO (const string s) {
  freopen(string(s + ".in").c_str(), "r", stdin);
  freopen(string(s + ".out").c_str(), "w", stdout);
}

const int T = (1 << 16) + 5;

int n, m, bag[20], v[20], w[20], t, id[T], aid[T][20], stk[20][20], top[20];
bool dp[T];
ll v_[T], ans = -1, ID;

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

signed main () {
  ios::sync_with_stdio(0), cin.tie(0);
  // FileIO("");
  cin >> n >> m, t = (1 << m), dp[0] = 1;
  for (int i = 1; i <= n; i++)
    cin >> bag[i];
  for (int i = 0; i < m; i++)
    cin >> w[i] >> v[i];
  id[0] = -1;
  for (int j = 1; j < t; j++)
    id[j] = id[j / 2] + 1, v_[j] = v_[j - lowbit(j)] + v[id[lowbit(j)]];
  for (int i = 1; i <= n; i++)
    for (int j = t - 1; j >= 0; j--) {
      for (int k = j; k && !dp[j]; k = ((k - 1) & j)) if (v_[k] <= bag[i] && dp[j - k]) {
        dp[j] = 1;
        for (int l = 0; l < m; l++)
          aid[j][l] = ((k >> l & 1) ? i : aid[j - k][l]);
        //cout << i << ' ' << j << ' ' << k << '\n';
        break;
      }
    }
  for (int i = 0; i < t; i++) if (dp[i]) {
    ll sum = 0;
    for (int j = 0; j < m; j++)
      sum += (i >> j & 1) * w[j];
    if (sum > ans) ans = sum, ID = i;
  }
  cout << ans << '\n';
  for (int i = 0; i < m; i++)
    stk[aid[ID][i]][++top[aid[ID][i]]] = i + 1;
  for (int i = 1; i <= n; i++) {
    cout << top[i] << ' ';
    for (int j = 1; j <= top[i]; j++)
      cout << stk[i][j] << ' ';
    cout << '\n';
  }
  return 0;
}