#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> e(n);
    rep(i,n) cin >> e[i];
    vector<int> v(m), w(m);
    rep(i,m) cin >> v[i] >> w[i];
    vector<ll> W(1<<m), V(1<<m);
    rep(j,1<<m) {
        rep(l,m) {
            if(j>>l&1) {
                W[j] += w[l];
                V[j] += v[l];
            }
        }
    }
    vector<vector<ll>> dp(n+1, vector<ll>(1<<m, -1e18));
    dp[0][0] = 0;
    int msk = (1<<m)-1;
    rep(i,n){
        rep(j,1<<m) {
            if(dp[i][j]==-1e18) continue;
            int r = j^msk;
            int h = r;
            dbg(r,j);
            while(true) {
                assert((h&j)==0);
                dbg(h);
                if(W[h]<=e[i]) dp[i+1][j|h] = max(dp[i+1][j|h], dp[i][j] + V[h]);
                if(h==0) break;
                h = (h-1) & r;
            }
        }
    }
    dbg(dp);
    ll ans = 0;
    rep(i,1<<m) ans = max(ans, dp[n][i]);
    int id = max_element(dp[n].begin(),dp[n].end()) - dp[n].begin();
    vector<vector<int>> can(n);
    dbg(id);
    for(int i=n-1;i>=0;i--) {
        rep(j,1<<m) {
            int c = id^j;
            if(W[c] <= e[i] && dp[i][j]+V[c]==dp[i+1][id]) {
                id = j;
                rep(k,m) if(c>>k&1) can[i].push_back(k);
                break;
            }
        }
    }
    cout << ans << endl;
    rep(i,n) {
        cout << can[i].size() << " ";
        for(int c : can[i]) {
            cout << c+1 << " ";
        }
        cout << endl;
    }
    return 0;
}