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

int Power(int a, int n){
    int ret = 1;
    int p = a; 
    while (n){
        if (n & 1) ret = ret * p;
        p = p * p;
        n >>= 1;
    } 
    return ret; 
}

pair<int,int> pairmax(pair<int,int> a,pair<int,int> b,int pre){
    if(b > a)swap(a,b);
    if(a.first > b.first){
    }
}


int main(){
    int inf = 2e9;//無限大として扱う値
    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<pair<int,int>> knap(Power(2,M),{0,0});//ステップ1:各荷物の選び方についてどうのこうの
    for(int i = 0;i < (1 << M);i++){
        bool over = 0;
        int wsum = 0;
        int vsum = 0;
        for(int j = 0;j < M;j++){
            if(i & (1 << j)){
                wsum += w[j];
                vsum += v[j];
            }
            if(wsum > 1e9)over = 1;
        }
        if(over)knap[i] = {vsum,inf};
        else knap[i] = {vsum,wsum};
    }

    int ans = 0;
    vector<vector<pair<int,int>>> dp(N+1,vector<pair<int,int>>(Power(2,M),{0,0}));
    for(int i = 0;i < N;i++){//ステップ2
        for(int j = 1;j < (1 << M);j++){
            int nowbit = j;
            while(true){
                //dp[i+1][j] = max(dp[i+1][j],dp[i][nowbit] + knap[j ^ nowbit][e[i]]);
                if(knap[j^nowbit].second <= e[i] && dp[i+1][j].first < dp[i][nowbit].first + knap[j^nowbit].first){
                    //cout << "!" << i << " " << j << endl;
                    //cout << "!" << i << " " << j << " " << nowbit << endl;
                    dp[i+1][j].first = dp[i][nowbit].first + knap[j^nowbit].first;
                    dp[i+1][j].second = j ^ nowbit;
                }
                if(nowbit == 0)break;
                nowbit--;
                nowbit &= j;
            }
            //cout << dp[i+1][j].first << " " << dp[i+1][j].second << "  ";
            ans = max(ans,dp[i+1][j].first);
        }
        //cout << endl;
    }

    cout << ans << endl;
    vector<int> ans2(1 + N,0);
    bool loopbreak = 0;
    for(int i = 1;i <= N;i++){
        for(int j = 1;j < (1 << M);j++){
            if(dp[i][j].first == ans){
                
                while(i > 0){
                    //cout << j << endl;
                    ans2[i] = dp[i][j].second;
                    
                    j -= dp[i][j].second;
                    i--;
                }
                loopbreak = 1;
                break;
            }
        }
        if(loopbreak)break;
    }

    for(int i = 1;i <= N;i++){
        int count = 0;
        vector<int> out = vector<int> (0);
        for(int j = 0;j < M;j++){
            if(ans2[i] & (1 << j)){
                count++;
                out.push_back(j+1);
            }
        }
        cout << count << " ";
        for(int j : out)cout << j << " ";
        cout << endl;
    }

    return 0;
}