#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
ll E[16];
ll V[16],W[16];
ll Vs[1<<16];
ll Ws[1<<16];

ll dp[17][1<<16];
int from[17][1<<16];
int ret[16];
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,N) cin>>E[i];
	FOR(i,M) cin>>V[i]>>W[i];
	
	int mask;
	FOR(mask,1<<M) FOR(i,M) if(mask&(1<<i)) Vs[mask]+=V[i],Ws[mask]+=W[i];
	
	FOR(i,N) {
		FOR(mask,1<<M) {
			for(int sm=mask;;sm--) {
				if(sm<0) break;
				sm&=mask;
				int ot=mask^sm;
				if(Ws[sm]<=E[i]&&dp[i+1][mask]<dp[i][ot]+Vs[sm]) {
					dp[i+1][mask]=dp[i][ot]+Vs[sm];
					from[i+1][mask]=sm;
				}
			}
		}
	}
	int cur=(1<<M)-1;
	for(i=N-1;i>=0;i--) {
		ret[i]=from[i+1][cur];
		cur^=from[i+1][cur];
	}
	cout<<dp[N][(1<<M)-1]<<endl;
	FOR(i,N) {
		cout<<__builtin_popcount(ret[i]);
		FOR(j,M) if(ret[i]&(1<<j)) cout<<" "<<j+1;
		cout<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}