//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

  using i8 = std::int_fast8_t;
  using i32 = std::int_fast32_t;
  using i64 = std::int_fast64_t;
  using u8 = std::uint_fast8_t;
  using u32 = std::uint_fast32_t;
  using u64 = std::uint_fast64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }

} // namespace n91

#include <algorithm>
#include <iostream>
#include <limits>
#include <numeric>
#include <set>
#include <utility>

namespace n91 {

  void main_() {
    /*
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //*/
    const usize n = scan<usize>();
    const u32 k = scan<u32>();
    std::vector<u32> a(n);
    std::iota(a.begin(), a.end(), k);
    if (n % 2 == 1) {
      if(n!=1){
        usize i = 0;
        usize j = n / 2 - 1;
        while (i < j) {
          std::swap(a[i], a[j]);
          i += 1;
          j -= 1;
        }
      }
      {
        usize i = n / 2;
        usize j = n - 1;
        while (i < j) {
          std::swap(a[i], a[j]);
          i += 1;
          j -= 1;
        }
      }
    }
    else {
      {
        usize i = 0;
        usize j = n / 2 - 1;
        while (i < j) {
          std::swap(a[i], a[j]);
          i += 1;
          j -= 1;
        }
      }
      {
        usize i = n / 2 + 1;
        usize j = n - 1;
        while (i < j) {
          std::swap(a[i], a[j]);
          i += 1;
          j -= 1;
        }
      }
    }
    struct p {
      u32 x, y;
      u32 sum() const { return x + y; }
    };
    std::vector<p> v(n);
    std::vector<u32> z(n);
    std::iota(z.begin(), z.end(), k + n * 2);
    for (const usize i : rep(0, n)) {
      v[i] = { a[n - 1 - i], k + n + i };
    }
    std::sort(v.begin(), v.end(), [](p l, p r) { return l.sum() < r.sum(); });
    for (const usize i : rep(0, n)) {
      if (v[i].sum() > z[i]) {
        std::cout << "-1" << std::endl;
        return;
      }
    }
    for (const usize i : rep(0, n)) {
      std::cout << v[i].x << ' ' << v[i].y << ' ' << z[i] << std::endl;
    }
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 5376