N, M = map(int, input().split())
e = list(map(int, input().split()))
v, w = [], []
for _ in range(M):
    vi, wi = map(int, input().split())
    v.append(vi)
    w.append(wi)

sum_v, sum_w = [0]*(1<<M), [0]*(1<<M)
for S in range(1<<M):
    for i in range(M):
        if S>>i&1:
            sum_v[S] += v[i]
            sum_w[S] += w[i]

dp = [[0]*(1<<M) for _ in range(N+1)]
for i in range(N):
    for S in range(1<<M):
        U = (1<<M) - 1 - S
        T = U
        while True:
            if sum_w[T] <= e[i]:
                dp[i+1][S|T] = max(dp[i+1][S|T], dp[i][S]+sum_v[T])
            if T == 0:
                break
            T = (T-1)&U

m = max(dp[N]) 
S = dp[N].index(m)

ans = [[] for _ in range(N)]
for i in range(N, 0, -1):
    T = S
    while True:
        if dp[i][S] == dp[i-1][S^T] + sum_v[T] and sum_w[T] <= e[i-1]:
            for j in range(M):
                if T>>j&1:
                    ans[i-1].append(j+1)
            S ^= T
            break
        T = (T-1)&S

print(m)
for a in ans:
    print(len(a), *a)