#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
	int n,m;scanf("%d%d",&n,&m);
	if(m==0){
		for(int i=1;i<=n;i++) printf("%d %d\n",2*i-1,2*i);
		return 0;
	}
	if(m<0){
		printf("-1\n");
		return 0;
	}
	if(m>=n-1){
		printf("-1\n");
		return 0;
	}
	m++;
	printf("1 %d\n",2*(m+1));
	for(int i=1;i<=m;i++) printf("%d %d\n",2*i,2*i+1);
	for(int i=m+2;i<=n;i++) printf("%d %d\n",2*i-1,2*i);
	return 0;
}
    /**   Created by: Humberto Yusta
          Codeforces User: humbertoyusta
          Country: Cuba
          Copyright��                    */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
//#pragma GCC target("avx2") //Enable AVX
/// Macros:
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
/// Constraints:
const int maxn = 1000010;
const int mod = 1000000007;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = 1ll * mod * mod;
const ld pi = acos(-1);
/// Prime Numbers:
// 2, 173, 179, 181, 197, 311, 331, 737, 1009, 2011, 2027, 3079, 4001, 10037, 10079, 20011, 20089;
// 100003, 100019, 100043, 200003, 200017, 1000003, 1000033, 1000037, 1000081;
// 2000003, 2000029, 2000039, 1000000007, 1000000021, 2000000099;
/// rng
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/// Functions:
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
/// Red-Black Tree Template ---------------------------------
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree < long long ,  null_type ,  less<long long> ,  rb_tree_tag ,  tree_order_statistics_node_update > ordered_set;
/// Quick Pow------------------------------------------------
int qpow(int b,int e){
    if( !e ) return 1;
    if( e & 1 ) return qpow(b,e-1) * b % mod;
    int pwur = qpow(b,e>>1);
    return pwur * pwur % mod;
}
int modinv(int x){
    return qpow(x,mod-2);
}
/// My Code -------------------------------------------------

int n, m;
vector<ii> ans;

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout.setf(ios::fixed); cout.precision(0);
    srand(time(NULL));

    //freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);

    cin >> n >> m;

    if( n == 1 && m == 0 ){
        cout << 1 << ' ' << 2 << '\n';
        return 0;
    }

    if( m >= 0 ){
        if( m + 1 > n - 1 ){ cout << -1 << '\n'; return 0; }
        ans.pb({1,2*(m+1)+1});
        int curr = 2;
        for(int i=1; i<=m; i++){
            ans.pb({curr,curr+1});
            curr += 2;
        }
        ans.pb({curr,curr+2});
        curr += 3;
        for(int i=m+1+1+1; i<=n; i++){
            ans.pb({curr,curr+1});
            curr += 2;
        }
    }
    else{
        cout << -1 << '\n';
        return 0;
    }

    for( auto i : ans )
        cout << i.f << ' ' << i.s << '\n';

    return 0;
}
