#include <fstream>
#include <cstring>
#include <vector>

#define NMAX 9000

using namespace std;

ifstream f("felinare.in");
ofstream g("felinare.out");

vector <vector <int>> v;

int a , b , m , node1 , node2 , c , n;
int r[NMAX] , l[NMAX] , sol[NMAX];

bool viz[NMAX] , ss[NMAX] , sd[NMAX];

bool pair_up(int node);
void solve(int node);

int main() {
    f >> n >> m;

    v.resize(n + 2);
    for (int i = 1; i <= m; ++i) {
        f >> node1 >> node2;
        v[node1].push_back(node2);
    }

    a = n;
    b = n;

    bool flag = true;
    while (flag) {
        flag = false;
        memset (viz , 0 , sizeof(viz));

        for (int i = 1; i <= a; ++i) {
            if(l[i] == 0 && pair_up(i)) {
                ++c;
                flag = true;
            }
        }
    }

    g << 2 * n - c << '\n';

    for (int i = 1; i <= a; ++i) {
        sol[i] = 3;
    }

    for (int i = 1; i <= a; ++i) {
        if (l[i]) {
            sol[i] -= 1;
            ss[i] = 1;
        }
    }

    for (int i = 1; i <= a; ++i) {
        solve(i);
    }

    for (int i = 1; i <= a; ++i) {
        g << sol[i] << '\n';
    }
    return 0;
}

void solve(int node) {
    if(ss[node])
        return;

    for (vector <int> :: iterator it = v[node].begin(); it != v[node].end(); ++it) {
        int p = *it;
        if(sd[*it] == 0) {
            sol[*it] -= 2;
            sd[*it] = 1;

            sol[r[*it]] += 1;
            ss[r[*it]] = 0;

            solve(r[*it]);
        }
    }
}

bool pair_up(int node) {
    if(viz[node]) {
        return 0;
    }

    viz[node] = 1;
    for(vector <int> :: iterator it = v[node].begin() ; it != v[node].end() ; ++it) {
        int p = *it;
        if(r[p] == 0 || pair_up(r[p])) {
            l[node] = *it;
            r[*it] = node;
            return 1;
        }
    }

    return 0;
}