import sys

def main():
    tokens = sys.stdin.read().split()
    it = iter(tokens)
    def next_token():
        return next(it)

    cas = int(next_token())
    N = 10**5
    c = [0] * N
    q = [[] for _ in range(N)]
    for _ in range(cas):
        n = int(next_token())
        k = int(next_token())
        tp = -1
        op = -1
        cc = [0, 0]
        for i in range(k):
            c[i] = int(next_token())
            if c[i] >= 2:
                tp = i
            else:
                cc[c[i]] += 1
                if c[i] == 1:
                    op = i
        if tp != -1:
            print(n - 1)
            for i in range(1, n):
                print(1, i + 1, tp + 1)
            continue
        t = 0
        sp = 1
        psp = 1
        while True:
            while t == sp * (sp - 1) // 2:
                sp += 1
            if t * (k - 1) + (sp - 1) * cc[1] >= n - 1:
                break
            psp = sp
            t += 1
        rq = t * (k - 1) + (sp - 1) * cc[1] - (n - 1)
        if cc[1] == 0:
            sp = 1
        for i in range(n):
            q[i].clear()
        rs = []
        for i in range(k):
            qc = t + (sp - 1 if c[i] else 0)
            rd = min(rq, 1 + (1 if psp != sp and c[i] == 1 else 0), qc)
            if op == i:
                rd = 0
            qc -= rd
            rq -= rd
            j_start = 0 if c[i] else sp - 1
            for j in range(j_start, sp * (sp - 1) // 2):
                if qc > 0:
                    q[j].append(i)
                    qc -= 1
                else:
                    break
            rs.append((qc, i))
        rs.sort()
        assert rs[-1][0] - rs[0][0] <= 1
        ans = []
        ind = sp
        id_ = 0
        for i in range(sp):
            for j in range(i + 1, sp):
                assert len(q[id_]) > 0
                x = q[id_].pop()
                lst = i
                for y in q[id_]:
                    ans.append((lst, ind, y))
                    lst = ind
                    ind += 1
                ans.append((lst, j, x))
                id_ += 1
        while rs[-1][0] > 0:
            fst = -1
            lst = 0
            for idx in range(len(rs)):
                cn, x = rs[idx]
                if cn > 0:
                    rs[idx] = (cn - 1, x)
                    if fst == -1:
                        fst = x
                    else:
                        ans.append((lst, ind, x))
                        lst = ind
                        ind += 1
            assert fst != -1
            ans.append((lst, 0, fst))
        assert len(ans) == (n - 1 + t)
        print(len(ans))
        for x, y, v in ans:
            print(x + 1, y + 1, v + 1)

if __name__ == "__main__":
    main()