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

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	constexpr int r = 1'000'000'000;
	int n, m;
	cin >> n >> m;
	vector<int> a(n);
	vector<pair<int,int>> b(m);
	vector<int> dpv(1 << m), dpw(1 << m), par(1 << m, -1), dp(1 << m, -2);
	for(auto &&v : a) cin >> v;
	for(auto &&[v, w] : b) cin >> v >> w;
	for(int S = 1; S < (1 << m); S++){
		int sv = 0, sw = 0;
		for(int i = 0; i < m && sw <= r; i++){
			if(S >> i & 1){
				sv += b[i].first;
				sw += b[i].second;
			}
		}
		dpv[S] = sv;
		dpw[S] = sw;
	}
	const int SS = (1 << m) - 1;
	dp[0] = -1;
	for(int i = 0; i < n; i++){
		int w = a[i];
		for(int S = SS; S >= 0; S--){
			if(dp[S] == -2) continue;
			int T = SS ^ S;
			for(int U = T; U > 0; U = (U - 1) & T){
				if(dpw[U] <= w && dp[S | U] == -2){
					dp[S | U] = i;
					par[S | U] = S;
				}
			}
		}
	}
	vector<int> ans(n);
	int mx = 0, pos = 0;
	for(int S = 1; S < (1 << m); S++){
		if(dp[S] != -2 && dpv[S] > mx){
			mx = dpv[S];
			pos = S;
		}
	}
	while(pos != 0){
		ans[dp[pos]] = pos ^ par[pos];
		pos = par[pos];
	}
	cout << mx << '\n';
	for(int i = 0; i < n; i++){
		cout << __builtin_popcount(ans[i]);
		for(int j = 0; j < m; j++){
			if(ans[i] >> j & 1) cout << ' ' << j + 1;
		}
		cout << '\n';
	}
}