#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> e(N);
    for (ll i = 0; i < N; i++) {
        cin >> e[i];
    }
    vector<ll> v(M);
    vector<ll> w(M);
    for (ll i = 0; i < M; i++) {
        cin >> v[i] >> w[i];
    }
    // N*3^N の全探索をするだけで OK かな？

    ll INF = 10000000000000023;
    vector bitdp(N + 1, vector<ll>(1 << M, -INF));
    bitdp[0][0] = 0;

    vector weight(N, vector<ll>(1 << M, 0));
    vector sum(N, vector<ll>(1 << M, 0));

    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < (1 << M); j++) {
            for (ll k = 0; k < M; k++) {
                if ((j >> k) & 1) {
                    weight[i][j] += w[k];
                    sum[i][j] += v[k];
                }
            }
        }
        for (ll j = 0; j < (1 << M); j++) {
            ll flips = (1 << M) - 1 - j;
            for (ll k = flips;; k = (k - 1) & flips) {
                // debug_out(k, flips);
                if (weight[i][k] <= e[i]) {
                    bitdp[i + 1][j + k] =
                        max(bitdp[i + 1][j + k], bitdp[i][j] + sum[i][k]);
                }
                if (k == 0) {
                    break;
                }
            }
        }
    }
    ll ans_val = -INF;
    ll ans_idx = -1;
    for (ll i = 0; i < (1 << M); i++) {
        if (ans_val < bitdp[N][i]) {
            ans_val = bitdp[N][i];
            ans_idx = i;
        }
    }
    cout << ans_val << endl;

    vector ans_vec(N, vector<ll>(0));
    ll now_idx = ans_idx;
    for (ll i = N - 1; i >= 0; i--) {
        for (ll j = now_idx;; j = (j - 1) & now_idx) {
            if (bitdp[i][now_idx - j] == bitdp[i + 1][now_idx] - sum[i][j]) {
                if (weight[i][j] <= e[i]) {
                    for (ll k = 0; k < M; k++) {
                        if ((j >> k) & 1) {
                            ans_vec[i].push_back(k);
                        }
                    }
                    now_idx -= j;
                    break;
                }
            }
            if (j == 0) {
                break;
            }
        }
    }
    for (ll i = 0; i < N; i++) {
        ll siz = ans_vec[i].size();
        cout << siz;
        for (ll j = 0; j < siz; j++) {
            cout << " " << ans_vec[i][j] + 1;
        }
        cout << endl;
    }
}