#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
    for (auto i = first;i != last;i++){
        cin >> (*i);
    }
}
template<class itr> void array_output(itr start,itr goal){
    string ans = "",k = " ";
    for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) {
    return a ? gcd(b%a,a) : b;
}
const ll INF = 1e9;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
typedef pair<double,double> point;
const ll MAX = 200005;
constexpr ll nx[8] = {1,0,-1,0,1,-1,1,-1};
constexpr ll ny[8] = {0,1,0,-1,1,1,-1,-1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,m;
    cin >> n >> m;
    if (n%2){
        ll l = 1,r = n;
        rep(i,m){
            printf("%lld %lld\n",l,r);
            l++;
            r--;
        }
    }
    else{
        ll k = n/2;
        ll l = 1,r = n;
        rep(i,min(k/2,m)){
            printf("%lld %lld\n",l,r);
            l++;
            r--;
        }
        r--;
        rep(i,m-k/2){
            printf("%lld %lld\n",l,r);
            l++;
            r--;
        }
    }
}

#include<cstdio>
#include<algorithm>
using namespace std;

int main(){
  int n,rank[100];
  pair<int,int> point[100];
  scanf("%d",&n);
  for(int i=0;i<n;i++){
    point[i].first = 0;
    point[i].second = i;
  }
  for(int i=0;i<n*(n-1)/2;i++){
    int a,b,c,d;
    scanf("%d %d %d %d",&a,&b,&c,&d);
    if(c<d){
      point[b-1].first += 3;
    }else if(c>d){
      point[a-1].first += 3;
    }else{
      point[a-1].first += 1;
      point[b-1].first += 1;
    }
  }
  sort(point,point+n);
  reverse(point,point+n);
  int r;
  for(int i=0;i<n;i++){
    int team = point[i].second;
    if(i>0&&point[i].first==point[i-1].first){
      rank[team] = r;
    }else{
      r = i+1;
      rank[team] = r;
    }
  }
  for(int i=0;i<n;i++) printf("%d\n",rank[i]);
  return 0;
}