#include <bits/stdc++.h>

using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())

template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')
    cerr<<*sdbg++;
  cerr<<'='<<h<<',';
  _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream& os, vector<T> V) {
  os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

struct Sol{
  void run(){
    int n,k;
    cin >> n >> k;
    int kt = -1;
    vector<int> jed;
    R(i,k){
      int c;
      cin >> c;
      if(c >= 2){
        kt = i;
      }
      if(c == 1)jed.PB(i);
    }
    if(kt != -1){
      cout << n - 1 << "\n";
      R(i,n-1){
        cout << "1 " << i + 2 << " " << kt + 1 << "\n";
      }
    }else {
      vector<vector<int>> res;
      if(SZ(jed) + 1 >= n){
        while(n > 1){
          n--;
          res.PB({n, 0, jed.back()});
          jed.pop_back();
        }


      }else{
        int a = k - SZ(jed);
        int b = SZ(jed);
        int id = 1;
        if(b){
          int naj = 1e9;
          int jak = -1;
          debug(a,b);
          for(int roz = 3; roz <= n; roz++){
            int ed = roz * (roz - 1) / 2;
            int mm = b * ed;
            int nn = roz + (b - 1) * ed;
            int to_add = (ed - roz + 1) * a;
            int dod = min(n - nn, to_add);
            debug(roz, ed, mm, nn, to_add, dod);
            nn += dod;
            mm += dod;
            int cyk = (n - nn + k - 2) / (k - 1);
            debug(cyk);
            int ress = mm + n - nn + cyk;
            if(naj > ress){
              naj = ress;
              jak = roz;
            }
          }
          debug(naj, jak);
          id = jak;
          R(po, jak)R(ko, po){
            if(ko == 0){
              vector<int> ak;
              ak.PB(po);
              while(SZ(ak) != SZ(jed) && id != n){
                ak.PB(id);
                id++;
              }
              ak.PB(ko);
              R(i,SZ(ak)-1){
                res.PB({ak[i], ak[i + 1], jed[i]});
              }
            }else{
              vector<int> ak;
              ak.PB(po);
              while(SZ(ak) != k && id != n){
                ak.PB(id);
                id++;
              }
              ak.PB(ko);
              R(i,SZ(ak)-1){
                res.PB({ak[i], ak[i + 1], i});
              }
            }
          }
        }
        debug(res);
        vector<int> ak;
        R(i,n)if(i >= id){
          ak.PB(i);
          if(SZ(ak) == k - 1 || i == n-1){
            R(j,SZ(ak)- 1){
              res.PB({ak[j], ak[j+1], j});
            }
            res.PB({ak[0], 0, k-2});
            res.PB({ak.back(), 0, k - 1});
            ak.clear();
          }
        }
      }
      cout << SZ(res) << "\n";
      for(auto el:res){
        for(auto x:el){
          cout << x + 1 << " ";
        }
        cout << "\n";
      }
    }
  }
};

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  cerr << fixed << setprecision(6);
  int t;
  cin >> t;
  while(t--){
    Sol sol;
    sol.run();
  }

}