import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readLong();
      const K = readLong();
      debug {
        writeln("N = ", N, ", K = ", K);
      }
      
      if (2 * K <= N + 1) {
        long[] as, bs, cs;
        
        foreach (i; 0 .. N) {
          cs ~= K + 3 * N - 1 - i;
        }
        
        const w = (N - 1) / 2;
        debug {
          writeln("  w = ", w);
        }
        foreach (i; 0 .. w) {
          as ~= K + 2 * N - 1 - i;
          bs ~= K + N - 1 - w - i;
          as ~= K + N + w - 1 - i;
          bs ~= K + N - 1 - i;
        }
        foreach (i; w .. N - w) {
          as ~= K + 2 * N - 1 - i;
          bs ~= K + N - 1 - w - i;
        }
        
        assert(as.length == N);
        assert(bs.length == N);
        assert(cs.length == N);
        foreach (i; 0 .. cast(int)(N)) {
          writeln(as[i], " ", bs[i], " ", cs[i]);
        }
        foreach (i; 0 .. cast(int)(N)) {
          assert(as[i] + bs[i] <= cs[i]);
        }
        debug {
          auto xs = as.dup ~ bs.dup ~ cs.dup;
          xs.sort();
          foreach (j; 0 .. cast(int)(3 * N)) {
            assert(xs[j] == K + j);
          }
        }
      } else {
        writeln("-1");
      }
    }
  } catch (EOFException e) {
  }
}
