#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<ll, ll> LP;

ll POW(ll x,ll n){
  if(n==0)return 1;
  if(n%2==0)return POW(x*x,n/2)%MOD;
  return x%MOD*POW(x,n-1)%MOD;
}

ll POW2(ll x,ll n){
  if(n==0)return 1;
  if(n%2==0)return POW2(x*x,n/2);
  return x*POW2(x,n-1);
}

ll POW3(ll x,ll n,ll m){
  x%=m;
  if(n==0)return 1;
  if(n%2==0)return POW3(x*x,n/2,m)%m;
  return x*POW3(x,n-1,m)%m;
}

ll gcd(ll u, ll v) {
  ll r;
  while (0 != v) {
    r = u % v; u = v; v = r;
  }
  return u;
}

ll lcm(ll u, ll v) {
  return u*v/gcd(u,v);
}
 
ll KAI(ll m)
{
  if(m<0) return 0;
  if(m==0) return 1;
  return m*KAI(m-1)%MOD;
}
 
ll KAI2(ll m)
{
  if(m<0) return 0;
  if(m==0) return 1;
  return m*KAI2(m-1);
}

ll extGCD(ll a, ll b, ll &x, ll &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    ll d = extGCD(b, a%b, y, x);
    y -= a / b * x;
    return d;
}
 
inline ll mod(ll a, ll m) {
    return (a % m + m) % m;
}
 
ll modinv(ll a) {
    ll x, y;
    extGCD(a, MOD, x, y);
    return mod(x, MOD);
}
 
ll COM(ll m,ll n)
{
  if(m<n) return 0;
  if(n<0) return 0;
  if(n==0) return 1;
  if(m==n) return 1;
  return KAI(m)%MOD*modinv(KAI(n)%MOD*KAI(m-n)%MOD)%MOD;
}

ll COM2(ll m,ll n)
{
  if(m<n) return 0;
  if(n<0) return 0;
  if(n==0) return 1;
  if(m==n) return 1;
  return KAI2(m)/KAI2(n)/KAI2(m-n);
}

ll DEC(ll x,ll m,ll n)//xのm進数でのx^nの位の値
{
  return x%POW(m,n+1)/POW(m,n);
}

ll keta(ll x,ll n)//xのn進数での桁数
{
  if(x==0)return 0;
  return keta(x/n,n)+1;
}

ll DIV(ll x,ll n)//x!のnで割り切れる回数
{
  if(x==0)return 0;
  return x/n+DIV(x/n,n);
}

ll ORD(ll x,ll n)//xのnで割り切れる回数
{
  if(x==0)return INF;
  if(x%n!=0)return 0;
  return 1+ORD(x/n,n);
}

ll SGS(ll x,ll y, ll m)//1+x+…+x^(y-1)をmで割った余り
{
  if(y==0)return 0;
  if(y%2==0){
    return (1+POW3(x,y/2,m))*SGS(x,y/2,m)%m;
  }
  return (1+x*SGS(x,y-1,m))%m;
}

ll SSGS(ll x,ll y,ll m)//Σ[k=1→y](1+x+…+x^(k-1))をmで割った余り
{
  if(y==0)return 0;
  if(y==1)return 1;
  if(y%2==0){
    return (SSGS(x,y/2,m)*(POW3(x,y/2,m)+1)%m+SGS(x,y/2,m)*y/2%m)%m;
  }
  return (SSGS(x,y-1,m)*x%m+y)%m;
}

ll c=0;
void mon(ll n,ll k){
  if(k<=(n-2)*(n-3)/2){
    //FOR(i,1,n)printf("%lld %lld\n",i,n);
    c+=n-1;
    mon(n-1,k);
    return;
  }
  else{
    FOR(i,2,n+1){
      //printf("%lld 1\n",i);
      c++;
    }
    rep(i,((n-1)*(n-2)/2-k)/3){
      //printf("%lld %lld\n",2+3*i,3+3*i);
      //printf("%lld %lld\n",4+3*i,2+3*i);
      //printf("%lld %lld\n",4+3*i,3+3*i);
      c+=3;
    }
    if(((n-1)*(n-2)/2-k)%3==1){
      //printf("%lld %lld\n",2+((n-1)*(n-2)/2-k)/3*3,3+((n-1)*(n-2)/2-k)/3*3);
      c++;
    }
    if(((n-1)*(n-2)/2-k)%3==2){
      //printf("%lld %lld\n",2+((n-1)*(n-2)/2-k)/3*3,3+((n-1)*(n-2)/2-k)/3*3);
      //printf("%lld %lld\n",4+((n-1)*(n-2)/2-k)/3*3,5+((n-1)*(n-2)/2-k)/3*3);
      c+=2;
    }
    return;
  }
}

void mon2(ll n,ll k){
  if(k<=(n-2)*(n-3)/2){
    FOR(i,1,n)printf("%lld %lld\n",i,n);
    mon2(n-1,k);
    return;
  }
  else{
    FOR(i,2,n+1)printf("%lld 1\n",i);
    rep(i,((n-1)*(n-2)/2-k)/3){
      printf("%lld %lld\n",2+3*i,3+3*i);
      printf("%lld %lld\n",4+3*i,2+3*i);
      printf("%lld %lld\n",4+3*i,3+3*i);
    }
    if(((n-1)*(n-2)/2-k)%3==1)printf("%lld %lld\n",2+((n-1)*(n-2)/2-k)/3*3,3+((n-1)*(n-2)/2-k)/3*3);
    if(((n-1)*(n-2)/2-k)%3==2){
      printf("%lld %lld\n",2+((n-1)*(n-2)/2-k)/3*3,3+((n-1)*(n-2)/2-k)/3*3);
      printf("%lld %lld\n",4+((n-1)*(n-2)/2-k)/3*3,5+((n-1)*(n-2)/2-k)/3*3);
    }
    return;
  }
}

int main()
{
  ll n,k;
  cin >> n >> k;
  if(k>(n-1)*(n-2)/2)printf("-1");
  else if(k==0){
    printf("%lld\n",(n-1)*n/2);
   FOR(i,1,n){
     FOR(j,i+1,n+1){
       printf("%lld %lld\n",i,j);
     }
   }
  }
  else {
    mon(n,k);
    printf("%lld\n",c);
    mon2(n,k);
  }
} 

Measured memory_bytes: 256