INF = 1<<60

N, M = map(int, input().split())
A = list(map(int, input().split()))
item = [list(map(int, input().split())) for _ in range(M)]

A = sorted(enumerate(A), key=lambda x:x[1], reverse=True)

dp = [(INF, 0) for _ in range(1<<M)]
dp[0] = (0, 0)
pre = [-1]*(1<<M)
for bit in range(1<<M):
    if dp[bit][0] == INF: continue
    n, c = dp[bit]
    for i in range(M):
        if not 1<<i & bit:
            _, w = item[i]
            nn, nc = n, c+w
            if A[nn][1] < nc:
                nn += 1
                nc = w
            if nn < N and nc <= A[nn][1] and (nn, nc) < dp[bit|1<<i]:
                dp[bit|1<<i] = (nn, nc)
                pre[bit|1<<i] = bit

MAX = -1
now = -1
for bit in range(1<<M):
    if dp[bit][0] == INF: continue
    SUM = 0
    for i in range(M):
        if 1<<i & bit:
            SUM += item[i][0]
    if MAX < SUM:
        MAX = SUM
        now = bit

ans = [[] for _ in range(N)]
while 1 <= now:
    p = now^pre[now]
    for i in range(M):
        if 1<<i & p:
            ans[A[dp[now][0]][0]].append(i)
            break
    now = pre[now]

print(MAX)
for a in ans:
    print(len(a), *sorted([n+1 for n in a]))