#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main() {
	int n = ri();
	int m = ri();
	if (n == 1) {
		if (m == 0) puts("1 2");
		else puts("0");
		return 0;
	}
	if (m < 0 || m > n - 2) {
		puts("-1");
		return 0;
	}
	int first = n - 2 - m;
	for (int i = 0; i < first; i++) printf("%d %d\n", i * 2 + 1, i * 2 + 2);
	printf("%d %d\n", 2 * first + 1, 2 * n);
	for (int i = first + 1; i < n; i++) printf("%d %d\n", i * 2, i * 2 + 1);
	
	
	return 0;
}


// atcoder/arc106/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/

#include <bits/stdc++.h>

#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))

using namespace std;

template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }
template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }
template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }
template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; }
template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; }

template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }
template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }

using lli = long long int;
using ull = unsigned long long;
using point = complex<double>;
using str = string;
template<typename T> using vec = vector<T>;

constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1});
constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1});
constexpr lli mod = 1e9 + 7;

int main(int argc, char *argv[])
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.setf(ios_base::fixed);
  cout.precision(15);

  lli n, m;
  while (cin >> n >> m) {
    if (m == 0) {
      int a = 1;
      int b = a + 1;
      for (int i = 0; i < n; ++i) {
        cout << a << ' ' << b << endl;
        a = b + 1;
        b = a + 1;
      }
      continue;
    }

    const int M = 2 * 1e6;

    if (m < 0) {
      cout << -1 << endl;
      continue;
    }

    unless (m + 2 <= n) {
      cout << -1 << endl;
      continue;
    }

    if (m) {
      cout << 1 << ' ' << M << endl;
      int a = 2;
      int b = a + 1;
      for (int i = 0; i < m + 1; ++i) {
        cout << a << ' ' << b << endl;
        a = b + 1;
        b = a + 1;
      }
    }
    int a = M + 1;
    int b = a + 1;
    for (int i = m + 2; i < n; ++i) {
      cout << a << ' ' << b << endl;
      a = b + 1;
      b = a + 1;
    }
  }

  return 0;
}
