#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector< vector <int> > vvi;
typedef pair<int, int> pii;
typedef pair < pair < int, int >, int > piii;
typedef pair < pair <int, int > , pair <int, int> > piiii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
 
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define RFOR(i,a,b) for(int i = a-1; i >= b; i --)
#define all(a) a.begin(), a.end()
#define endl '\n';
#define sz(x) (int)(x).size()
 
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
 
template <typename T>
void pr(vector<T> &v) {
    FOR(i, 0, sz(v)) cout << v[i] << " ";
    cout << endl;
}
template <typename T>
void pr(vector<vector<T> > &v) {
    FOR(i, 0, sz(v)) { pr(v[i]); }
}
template <typename T>
void re(T &x) {
    cin >> x;
}
template <typename T>
void re(vector<T> &a) {
    FOR(i, 0, sz(a)) re(a[i]);
}
template <class Arg, class... Args>
void re(Arg &first, Args &... rest) {
    re(first);
    re(rest...);
}
template <typename T>
void pr(T x) {
    cout << x << endl;
}
template <class Arg, class... Args>
void pr(const Arg &first, const Args &... rest) {
    cout << first << " ";
    pr(rest...);
    cout << endl;
}
void ps() { cout << endl; }
template<class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
    cout << t; if (sizeof...(ts)) cout << " "; ps(ts...);
}
 
const ll MOD  =  1000000007;
#define inf 1e18;
#define INF INT_MAX;

long double PI = 4*atan(1);
long double eps = 1e-12;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//default_random_engine g{1};

int main() {
    //auto start = chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);cin.tie(0);
    // ofstream cout("pieaters.out");
    // ifstream cin("pieaters.in");
    #ifdef DEBUG
      freopen("input.txt", "r", stdin);
      freopen("output.txt", "w", stdout);
    #endif 
    

    int n,m; cin >> n >> m;
    vector<pii> e(m);
    vi deg(n);
    FOR(i,0,m) {
        cin >> e[i].ff >> e[i].ss;
        e[i].ff--; e[i].ss--;
        deg[e[i].ff]++;
        deg[e[i].ss]++;
    }
    bool good = false;
    vi ass(n);
    

    FOR(i,0,n) {
        int k = uniform_int_distribution<ll>(0,1000)(rng);
        ass[i] = k - 1000;
    }
    int cnt = 0;
    while(!good) {
        
        good = true;
        FOR(i,0,m) {
            if(ass[e[i].ff] == ass[e[i].ss]) {
                good = false;
                if(deg[e[i].ff] < deg[e[i].ss]) {
                    ass[e[i].ff] = uniform_int_distribution<ll>(0,1000)(rng);
                } else {
                    ass[e[i].ss] = uniform_int_distribution<ll>(0,1000)(rng);
                }
            }
        }
        cnt ++;
        
    }
    // cout << cnt << endl;
    

    

    FOR(i,0,m) {
        cout << ass[e[i].ff] - ass[e[i].ss] << endl;
    }


    // auto stop = chrono::high_resolution_clock::now();
    // auto duration = chrono::duration_cast<chrono::microseconds>(stop - start);
    // cout << duration.count() << endl;
    //cin.close();
    //cout.close();
}