#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct Item {
    int value;
    int weight;
};

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> e(N);
    for (int i = 0; i < N; ++i) {
        cin >> e[i];
    }

    vector<Item> items(M);
    for (int i = 0; i < M; ++i) {
        cin >> items[i].value >> items[i].weight;
    }

    int max_combinations = 1 << M; // 2^M combinations
    vector<int> dp(max_combinations, -1);
    vector<int> combination(max_combinations, 0);
    dp[0] = 0;

    for (int mask = 0; mask < max_combinations; ++mask) {
        if (dp[mask] == -1) continue;
        for (int i = 0; i < M; ++i) {
            if (!(mask & (1 << i))) { // if i-th item is not in the current combination
                int new_mask = mask | (1 << i);
                int new_value = dp[mask] + items[i].value;
                if (new_value > dp[new_mask]) {
                    dp[new_mask] = new_value;
                    combination[new_mask] = i;
                }
            }
        }
    }

    int max_value = 0;
    int best_combination = 0;
    for (int mask = 0; mask < max_combinations; ++mask) {
        if (dp[mask] > max_value) {
            bool valid = true;
            vector<int> total_weight(N, 0);
            for (int i = 0; i < M; ++i) {
                if (mask & (1 << i)) {
                    int selected_bag = 0;
                    for (int j = 0; j < N; ++j) {
                        if (total_weight[j] + items[i].weight <= e[j]) {
                            total_weight[j] += items[i].weight;
                            break;
                        }
                        selected_bag++;
                    }
                    if (selected_bag == N) {
                        valid = false;
                        break;
                    }
                }
            }
            if (valid) {
                max_value = dp[mask];
                best_combination = mask;
            }
        }
    }

    cout << max_value << endl;
    vector<vector<int>> bag_items(N);
    for (int i = 0; i < M; ++i) {
        if (best_combination & (1 << i)) {
            for (int j = 0; j < N; ++j) {
                int total_weight = 0;
                for (auto &item : bag_items[j]) {
                    total_weight += items[item].weight;
                }
                if (total_weight + items[i].weight <= e[j]) {
                    bag_items[j].push_back(i);
                    break;
                }
            }
        }
    }

    for (int i = 0; i < N; ++i) {
        cout << bag_items[i].size();
        for (auto &item : bag_items[i]) {
            cout << " " << item + 1;
        }
        cout << endl;
    }

    return 0;
}