#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	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<pair<long long, long long>>sum(1 << m);
	rep(i, 1 << m) {
		long long sv = 0;
		long long sw = 0;
		rep(j, m) {
			if (1 & (i >> j)) {
				sv += v[j];
				sw += w[j];
			}
		}
		sum[i] = { sv,sw };
	}
	long long mx = 0;
	vector dp(n + 1, vector<long long>((1 << m), -LINF));
	vector pre(n + 1, vector<long long>(1 << m));
	dp[0][0] = 0;
	int idx = 0;
	rep(i, n) {
		rep(j, 1 << m) {
			for (int k = (j - 1)&j; k > 0; k = (k - 1)&j) {
				int l = j ^ k;
				if (sum[l].second <= e[i] && chmax(dp[i + 1][j], dp[i][k] + sum[l].first)) {
					pre[i + 1][j] = k;
				}
			}
			if (sum[j].second <= e[i] && chmax(dp[i + 1][j], dp[i][0] + sum[j].first)) {
				pre[i + 1][j] = 0;
			}
			if (chmax(dp[i + 1][j], dp[i][j])) {
				pre[i + 1][j] = j;
			}
			if (chmax(mx, dp[i + 1][j]))idx = j;
		}
	}
	cout << mx << endl;
	vector<int>ans;
	rrep2(i, 1, n + 1) {
		ans.push_back(idx);
		idx = pre[i][idx];
		ans.back() ^= idx;
	}
	reverse(all(ans));
	rep(i, ans.size()) {
		vector<int>v;
		rep(j, m) if (1 & (ans[i] >> j)) v.push_back(j);
		cout << v.size() << " ";
		for (auto e : v)cout << e + 1 << " ";
		cout << endl;
	}
	return 0;
}