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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, m; cin >> n >> m;
	vector<ll> e(n), w(m), w_sum(1<<m);
	vector<int> v(m);
	vector<int> v_sum(1<<m);
	
	rep(i,0,n) cin >> e[i];
	rep(i,0,m){
		cin >> v[i] >> w[i];
	}
	rep(i,0,1<<m){
		rep(j,0,m){
			if(i>>j&1){
				v_sum[i]+=v[j];
				w_sum[i]+=w[j];
			}
		}
	}

	vector cf(n+1, vector<int>(1<<m, -1));
	cf[0][0] = 0;

	rep(i,0,n){
		rep(j,0,1<<m){
			if(w_sum[j] <= e[i]){
				int mask = ((1<<m)-1)^j;
				int k = mask;
				while (k > 0) {
					if (cf[i][k] != -1) {
						cf[i+1][k|j] = j;
					}
					k = (k-1) & mask;
				}
				if (cf[i][0] != -1) {
					cf[i+1][j] = j;
				}
			}
		}
	}

	int ans = -1;
	int ansind = -1;
	rep(i,0,1<<m){
		if(cf[n][i] >= 0) {
			if(chmax(ans,v_sum[i])) {
				ansind = i;
			}
		}
	}

	vector bucket(n, vector<int>(0));
	int now = ansind;
	rrep(i,0,n){
		int t = cf[i+1][now];
		rep(j,0,m){
			if(t>>j&1){
				bucket[i].push_back(j+1);
			}
		}
		now = now^t;
	}

	cout << ans << '\n';
	rep(i,0,n){
		cout << (int)bucket[i].size() << ' ';
		rep(j,0,(int)bucket[i].size()){
			cout << bucket[i][j] << ' ';
		}
		cout << '\n';
	}


}