#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define rrep(i, r, l) for (ll i = (r); i-- > (l);)
#define all(x) begin(x), end(x)
template <class T>
bool chmin(T& lhs, T rhs) {
    return lhs > rhs ? (lhs = rhs, true) : false;
}
template <class T>
bool chmax(T& lhs, T rhs) {
    return lhs < rhs ? (lhs = rhs, true) : false;
}
struct IOIO {
    IOIO() { cin.tie(0)->sync_with_stdio(0); }
} ioio;
template <class S, class T>
ostream& operator<<(ostream& os, const pair<S, T>& p) {
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
    os << '{';
    rep(i, 0, (int)vs.size()) os << vs[i] << (i + 1 == (int)vs.size() ? "" : ", ");
    os << '}';
    return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& vs) {
    os << '{';
    for (auto it = vs.begin(); it != vs.end(); it++) {
        if (it != vs.begin()) { os << ", "; }
        os << *it;
    }
    os << '}';
    return os;
}
template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& vs) {
    os << '{';
    for (auto it = vs.begin(); it != vs.end(); it++) {
        if (it != vs.begin()) { os << ", "; }
        os << *it;
    }
    os << '}';
    return os;
}
#ifdef DEBUG
void dump_func() { cerr << endl; }
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) { cerr << ", "; }
    dump_func(std::move(tail)...);
}
#define dump(...) cerr << "[" + string(#__VA_ARGS__) + "] ", dump_func(__VA_ARGS__)
#else
#define dump(...) static_cast<int>(0)
#endif
int main() {
    int n, m;
    cin >> n >> m;
    vector<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    vector<ll> ws(m), vs(m);
    rep(i, 0, m) cin >> vs[i] >> ws[i];
    vector<ll> sw(1 << m);
    vector<ll> sv(1 << m);
    rep(s, 0, 1 << m) rep(i, 0, m) if (s & (1 << i)) sw[s] += ws[i], sv[s] += vs[i];
    const ll none = -1;
    vector dp(n + 1, vector<ll>(1 << m, none));
    vector prv(n + 1, vector<int>(1 << m));
    dp[0][0] = 0;
    rep(i, 0, n) {
        rep(s, 0, 1 << m) {
            if (dp[i][s] == none) continue;
            int tt = (~s) & ((1 << m) - 1);
            for (int t = tt;; t = (t - 1) & tt) {
                if (sw[t] <= a[i]) {
                    if (chmax(dp[i + 1][s | t], dp[i][s] + sv[t])) { prv[i + 1][s | t] = t; }
                }
                if (t == 0) break;
            }
        }
    }
    ll max_v = -1;
    int max_s = 0;
    rep(i, 0, 1 << m) if (chmax(max_v, dp[n][i])) max_s = i;
    cout << max_v << endl;
    vector<int> ss;
    int j = max_s;
    rrep(i, n, 0) ss.push_back(prv[i + 1][j]), j = j ^ prv[i + 1][j];
    reverse(all(ss));
    rep(i, 0, n) {
        int s = ss[i];
        cout << popcount((unsigned)s);
        rep(j, 0, m) if (s & (1 << j)) cout << ' ' << j + 1;
        cout << '\n';
    }
}