import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskB.vertex[] cities = new TaskB.vertex[n];
            for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex();
            for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            }
            for (TaskB.vertex i : cities)
                out.println(i.vertices.size());
        }

        static class vertex {
            ArrayList<Integer> vertices = new ArrayList<>();

        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util import java.util.ArrayList; ArrayList java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskB.vertex[] cities = new TaskB.vertex[n];
            for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex();
            for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            }
            for (TaskB.vertex i : cities)
                out.println(i.vertices.size());
        }

        static class vertex {
            ArrayList<Integer> vertices = new ArrayList<>();

        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) TaskB solver = new TaskB(); solver new TaskB() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskB.vertex[] cities = new TaskB.vertex[n];
            for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex();
            for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            }
            for (TaskB.vertex i : cities)
                out.println(i.vertices.size());
        }

        static class vertex {
            ArrayList<Integer> vertices = new ArrayList<>();

        }

    } TaskB public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskB.vertex[] cities = new TaskB.vertex[n];
            for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex();
            for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            }
            for (TaskB.vertex i : cities)
                out.println(i.vertices.size());
        } solve {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskB.vertex[] cities = new TaskB.vertex[n];
            for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex();
            for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            }
            for (TaskB.vertex i : cities)
                out.println(i.vertices.size());
        } int n = in.nextInt(); n in.nextInt() in.nextInt in int m = in.nextInt(); m in.nextInt() in.nextInt in TaskB.vertex[] cities = new TaskB.vertex[n]; cities new TaskB.vertex[n] n for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex(); int i = 0; int i = 0; i 0 i < n i n ++i ++i i cities[i] = new TaskB.vertex(); cities[i] = new TaskB.vertex() cities[i] cities i new TaskB.vertex() for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            } int i = 0; int i = 0; i 0 i < m i m ++i ++i i {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            } {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            } int a = in.nextInt(); a in.nextInt() in.nextInt in int b = in.nextInt(); b in.nextInt() in.nextInt in cities[a - 1].vertices.add(b - 1) cities[a - 1].vertices.add cities[a - 1].vertices cities[a - 1] cities a - 1 a 1 cities[a - 1].vertices b - 1 b 1 cities[b - 1].vertices.add(a - 1) cities[b - 1].vertices.add cities[b - 1].vertices cities[b - 1] cities b - 1 b 1 cities[b - 1].vertices a - 1 a 1 for (TaskB.vertex i : cities)
                out.println(i.vertices.size()); TaskB.vertex i cities out.println(i.vertices.size()); out.println(i.vertices.size()) out.println out i.vertices.size() i.vertices.size i.vertices i i.vertices int testNumber testNumber Scanner in in PrintWriter out out static class vertex {
            ArrayList<Integer> vertices = new ArrayList<>();

        } vertex ArrayList<Integer> vertices = new ArrayList<>(); vertices new ArrayList<>() public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskB.vertex[] cities = new TaskB.vertex[n];
            for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex();
            for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            }
            for (TaskB.vertex i : cities)
                out.println(i.vertices.size());
        }

        static class vertex {
            ArrayList<Integer> vertices = new ArrayList<>();

        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskB.vertex[] cities = new TaskB.vertex[n];
            for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex();
            for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            }
            for (TaskB.vertex i : cities)
                out.println(i.vertices.size());
        }

        static class vertex {
            ArrayList<Integer> vertices = new ArrayList<>();

        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskB.vertex[] cities = new TaskB.vertex[n];
            for (int i = 0; i < n; ++i)
                cities[i] = new TaskB.vertex();
            for (int i = 0; i < m; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                cities[a - 1].vertices.add(b - 1);
                cities[b - 1].vertices.add(a - 1);
            }
            for (TaskB.vertex i : cities)
                out.println(i.vertices.size());
        }

        static class vertex {
            ArrayList<Integer> vertices = new ArrayList<>();

        }

    }
}

