//
// Created by yamunaku on 2020/10/24.
//

#include <bits/stdc++.h>
//#include <atcoder/all>

using namespace std;
//using namespace atcoder;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

int main() {
    //CFS;
    int n, m;
    cin >> n >> m;
    if (n == 1 && m == 0) {
        cout << 1 SP 2 << endl;
        return 0;
    }
    if (m < 0 || m >= n - 1) {
        cout << -1 << endl;
        return 0;
    }
    rep(i, n - 1) {
        cout << i * 20 + 10 SP i * 20 + 20 << endl;
    }
    if (m == 0) {
        cout << IINF - 1 SP IINF << endl;
    } else {
        cout << 5 SP m * 20 + 25 << endl;
    }
    return 0;
}

#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
    int n, m;
    while(cin>>n>>m){
        if(m<0 || (m>=n-1 && m!=0)){
        	printf("-1\n");
        }
        else{
        	if(m>0){
        		int tmp = 2;
        		for(int i=0; i<m+1; ++i){
        			printf("%d %d\n",tmp, tmp+1);
        			tmp+=2;
        		}
        		printf("1 %d\n",tmp);
        		++tmp;
        		for(int i=m; i<n-2; ++i){
        			printf("%d %d\n",tmp, tmp+1);
        			tmp+=2;
        		}
        	}
        	else{
        		int tmp = 1;
        		for(int i=0; i<n; ++i){
        			printf("%d %d\n",tmp, tmp+1);
        			tmp+=2;
        		}
        	}
        }
    }
  return 0;
}


