#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int N, M;
    cin >> N >> M;

    vector<int> e(N), v(M), w(M);
    for (int i = 0; i < N; i++) cin >> e[i];
    for (int i = 0; i < M; i++) cin >> v[i] >> w[i];

    vector<int> sum_v(1<<M); vector<ll> sum_w(1<<M);
    for (int S = 0; S < (1<<M); S++) {
        for (int i = 0; i < M; i++) {
            if (S>>i & 1) {
                sum_v[S] += v[i];
                sum_w[S] += w[i];
            }
        }
    }

    vector<vector<int>> dp(N+1, vector<int>(1<<M));
    for (int i = 0; i < N; i++) {
        for (int S = 0; S < (1<<M); S++) {
            int U = (1<<M) - 1 - S;
            for (int T = U; ; T = (T-1) & U) {
                if (sum_w[T] <= e[i]) {
                    dp[i+1][S|T] = max(dp[i+1][S|T], dp[i][S] + sum_v[T]);
                }
                if (T == 0) break;
            }
        }
    }

    int m = *max_element(dp[N].begin(), dp[N].end());
    int S = 0;
    while (dp[N][S] != m) S++;

    vector<vector<int>> ans(N);
    for (int i = N; i > 0; i--) {
        vector<int> a;
        for (int T = S; ; T = (T-1) & S) {
            // dp[i-1][S^T] -> dp[i][S] 
            if (dp[i][S] == dp[i-1][S^T] + sum_v[T] && sum_w[T] <= e[i-1]) {
                for (int j = 0; j < M; j++) {
                    if (T>>j & 1) a.push_back(j+1);
                }
                S ^= T;
                break;
            }
        }
        ans[i-1] = a;
    }

    cout << m << endl;
    for (int i = 0; i < N; i++) {
        cout << ans[i].size();
        for (int j : ans[i]) cout << " " << j;
        cout << endl;
    }
}