#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector<int> e(n);
  for (int& e_i : e) cin >> e_i;
  vector<int> v(m), w(m); REP(i, m) cin >> v[i] >> w[i];
  vector dp(n * m + 1, vector(1 << m, INF));
  vector prv(n * m + 1, vector(1 << m, false));
  dp[0][0] = 0;
  REP(i, n) REP(j, m) {
    REP(k, 1 << m) {
      if (dp[i * m + j][k] == INF) continue;
      if (chmin(dp[i * m + j + 1][k], dp[i * m + j][k])) prv[i * m + j + 1][k] = false;
      if (k >> j & 1) continue;
      const int weight = dp[i * m + j][k] + w[j];
      if (weight <= e[i] && chmin(dp[i * m + j + 1][k | (1 << j)], weight)) prv[i * m + j + 1][k | (1 << j)] = true;
    }
    if (j + 1 == m) {
      REP(k, 1 << m) {
        if (dp[(i + 1) * m][k] != INF) dp[(i + 1) * m][k] = 0;
      }
    }
  }
  int ans_v = 0, argmax_k = 0;
  FOR(k, 1, 1 << m) {
    if (dp[n * m][k] == INF) continue;
    int value = 0;
    REP(l, m) {
      if (k >> l & 1) value += v[l];
    }
    if (chmax(ans_v, value)) argmax_k = k;
  }
  vector<vector<int>> ans(n);
  for (int i = n - 1; i >= 0; --i) for (int j = m - 1; j >= 0; --j) {
    if (prv[i * m + j + 1][argmax_k]) {
      ans[i].emplace_back(j);
      argmax_k ^= 1 << j;
    }
  }
  cout << ans_v << '\n';
  REP(i, n) {
    cout << ans[i].size();
    for (const int e : ans[i]) cout << ' ' << e + 1;
    cout << '\n';
  }
  return 0;
}