#include <bits/stdc++.h>

using Bags = std::vector<std::stack<int>>;

int N, M;
std::vector<int> e;
std::vector<int> v, w;

void rec(
    int i,
    int val,
    Bags &bags,
    std::vector<int> &cap,
    int &max_val,
    Bags &max_bags
){
    if(i == M){
        if(val > max_val){
            max_val = val;
            max_bags = bags;
        }
        return;
    }

    for(int j=0;j<N;j++){
        if(w[i] <= cap[j]){
            bags[j].emplace(i);
            cap[j] -= w[i];
            rec(i + 1, val + v[i], bags, cap, max_val, max_bags);
            bags[j].pop();
            cap[j] += w[i];
        }
    }

    rec(i + 1, val, bags, cap, max_val, max_bags);
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N >> M;

    e.resize(N);
    for(int i=0;i<N;i++){
        std::cin >> e[i];
    }

    v.resize(M);
    w.resize(M);
    for(int i=0;i<M;i++){
        std::cin >> v[i] >> w[i];
    }

    Bags bags(N);
    std::vector<int> cap(N);
    for(int i=0;i<N;i++){
        cap[i] = e[i];
    }
    int max_val = 0;
    Bags max_bags(N);
    rec(0, 0, bags, cap, max_val, max_bags);

    std::cout << max_val << std::endl;
    for(int i=0;i<N;i++){
        std::cout << max_bags[i].size();

        while(!max_bags[i].empty()){
            int j = max_bags[i].top() + 1;
            max_bags[i].pop();
            std::cout << " " << j;
        }
        std::cout << std::endl;
    }
}