#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001


int main(){
	
	int N,M;
	cin>>N>>M;
	vector<long long> e(N);
	rep(i,N)cin>>e[i];
	vector<long long> v(M),w(M);
	rep(i,M)cin>>v[i]>>w[i];
	vector<long long> vs(1<<M),ws(1<<M);
	rep(i,1<<M){
		rep(j,M){
			if(i>>j&1){
				vs[i]+=v[j];
				ws[i]+=w[j];
			}
		}
	}
	vector dp(N+1,vector<long long>(1<<M,0));
	vector pre(N+1,vector<long long>(1<<M,-1));
	rep(i,N){
		rep(j,1<<M){
			dp[i+1][j] = dp[i][j];
			pre[i+1][j] = j;
			int S = j;
			for(int T=S;T>=0;T=((T-1)&S)){
				if(ws[T]<=e[i]){
					if(dp[i+1][S]<dp[i][S^T]+vs[T]){
						dp[i+1][S]=dp[i][S^T]+vs[T];
						pre[i+1][S]=(S^T);
					}
				}
				if(T==0)break;
			}
		}
	}
	long long ans = 0;
	int cur = 0;
	rep(i,1<<M){
		if(ans < dp[N][i]){
			ans = dp[N][i];
			cur = i;
		}
	}
	cout<<ans<<endl;
	vector<vector<int>> Ans(N);
	for(int i=N;i>0;i--){
		int T = pre[i][cur]^cur;
		cur = pre[i][cur];
		rep(j,M){
			if(T>>j&1){
				Ans[i-1].push_back(j+1);
			}
		}
	}
	rep(i,N){
		cout<<Ans[i].size();
		rep(j,Ans[i].size()){
			cout<<" "<<Ans[i][j];
		}
		cout<<endl;
	}
    return 0;
}