#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main() {
    int N, M; cin >> N >> M;
    if(N == 1 && M == 0){
        cout << 1 << " " << 2 << endl;
        return 0;
    }
    if(M < 0){
        cout << -1 << endl;
        return 0;
    } else if(M == N || M == N-1){
        cout << -1 << endl;
        return 0;
    }
    vector<int> L(N), R(N);
    int X = N - 1 - M;
    X--;
    int now = 1;
    rep(i, X){
        L[i] = now;
        now++;
        R[i] = now;
        now++;
    }
    L[X] = now;
    now++;
    R[X] = N * 2;
    for (int i = X+1; i < N; i++){
        L[i] = now;
        now++;
        R[i] = now;
        now++;
    }

    rep(i, N){
        cout << L[i] << " " << R[i] << endl;
    }

    return 0;
}
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	if(m==0){
		fup(i,1,n,1)printf("%d %d\n",i*2,i*2+1);
		return 0;
	}
	if(m<0 || m>=n-1)return !printf("-1\n");
	fup(i,1,m+1,1){
		printf("%d %d\n",2*i,2*i+1);
	}
	puts("1 500000");
	int rem=n-m-2;
	fup(i,1,rem,1){
		printf("%d %d\n",600000+2*i,600001+2*i);
	}
}