#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N = 5e05+10;
const LL mod = 1e09+7;
const int inf = 0x3f3f3f3f;
const LL llinf = 5e18;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >mi;//小根堆
priority_queue<LL> ma;//大根堆
void solve() 
{
	int n , m;
	cin >> n >> m;
	int w[m];
	for(int i = 0 ; i < m ; i ++){
		cin >> w[i];
	}	
	int l = 1 , r = 2;
	cout << 1 << " " << 2 << endl;
	int mp[n + 5][n + 5];
	memset(mp , 0 , sizeof mp);
	mp[1][2] = 1;
	for(int i = 1 ; i < n - 1 ; i ++){
		if(i & 1){
			cout << l << " " << i + 2 << endl;
			mp[l][i + 2] = 1;
			mp[i + 2][l] = 1;
			l = i + 2;
		}
		else{
			cout << r << " " << i + 2 << endl;
			mp[r][i + 2] = 1;
			mp[i + 2][r] = 1;
			r = i + 2;
		}
	}
	if(m > n - 1){
		cout << n << " " << n - 1 << endl;
		mp[n][n - 1] = 1;
		mp[n - 1][n] = 1;
		m--;
		for(int i = 1 ; i <= n ; i ++){
			for(int j = i + 1 ; j <= n ; j ++){
				if(m == n - 1){
					break;
				}
				if(mp[i][j] == 0){
					cout << i << " " << j << endl;
					m--;
				}
			}
		}
	}
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
    while(t--)
    {
    	solve();
    }
    return 0;
}