import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.HashMap;


public class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] ab = new int[m][2];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        }
        HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>();
        for (int i = 1; i < n+1; i++) {
            ans.put(i,0);
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        }
        for (int i = 1; i < n+1; i++) {
            System.out.println(ans.get(i));
        }
    }
}


class FastScanner {
    public static String debug = null;

    private final InputStream in = System.in;
    private int ptr = 0;
    private int buflen = 0;
    private byte[] buffer = new byte[1024];
    private boolean eos = false;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen < 0) {
                eos = true;
                return false;
            } else if (buflen == 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
    }

    public boolean isEOS() {
        return this.eos;
    }

    public boolean hasNext() {
        skipUnprintable();
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
              n *= 10;
              n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        return (int) nextLong();
    }

    public long[] nextLongList(int n) {
        return nextLongTable(1, n)[0];
    }

    public int[] nextIntList(int n) {
        return nextIntTable(1, n)[0];
    }

    public long[][] nextLongTable(int n, int m) {
        long[][] ret = new long[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        }
        return ret;
    }

    public int[][] nextIntTable(int n, int m) {
        int[][] ret = new int[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        }
        return ret;
    }
} import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.util.Arrays; Arrays java.util import java.util.NoSuchElementException; NoSuchElementException java.util import java.util.HashMap; HashMap java.util public class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] ab = new int[m][2];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        }
        HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>();
        for (int i = 1; i < n+1; i++) {
            ans.put(i,0);
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        }
        for (int i = 1; i < n+1; i++) {
            System.out.println(ans.get(i));
        }
    }
} Main public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] ab = new int[m][2];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        }
        HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>();
        for (int i = 1; i < n+1; i++) {
            ans.put(i,0);
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        }
        for (int i = 1; i < n+1; i++) {
            System.out.println(ans.get(i));
        }
    } main {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] ab = new int[m][2];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        }
        HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>();
        for (int i = 1; i < n+1; i++) {
            ans.put(i,0);
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        }
        for (int i = 1; i < n+1; i++) {
            System.out.println(ans.get(i));
        }
    } FastScanner sc = new FastScanner(); sc new FastScanner() int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int m = sc.nextInt(); m sc.nextInt() sc.nextInt sc int[][] ab = new int[m][2]; ab new int[m][2] m 2 for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        } int i = 0; int i = 0; i 0 i < m i m i++ i++ i {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        } {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        } for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            } int j = 0; int j = 0; j 0 j < 2 j 2 j++ j++ j {
                ab[i][j] = sc.nextInt();
            } {
                ab[i][j] = sc.nextInt();
            } ab[i][j] = sc.nextInt() ab[i][j] ab[i] ab i j sc.nextInt() sc.nextInt sc HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>(); ans new HashMap<Integer, Integer>() for (int i = 1; i < n+1; i++) {
            ans.put(i,0);
        } int i = 1; int i = 1; i 1 i < n+1 i n+1 n 1 i++ i++ i {
            ans.put(i,0);
        } {
            ans.put(i,0);
        } ans.put(i,0) ans.put ans i 0 for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        } int i = 0; int i = 0; i 0 i < m i m i++ i++ i {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        } {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        } for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            } int j = 0; int j = 0; j 0 j < 2 j 2 j++ j++ j {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            } {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            } if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                } ans.containsKey(ab[i][j]) ans.containsKey ans ab[i][j] ab[i] ab i j {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                } int tmp = ans.get(ab[i][j]); tmp ans.get(ab[i][j]) ans.get ans ab[i][j] ab[i] ab i j ans.put(ab[i][j], tmp+1) ans.put ans ab[i][j] ab[i] ab i j tmp+1 tmp 1 for (int i = 1; i < n+1; i++) {
            System.out.println(ans.get(i));
        } int i = 1; int i = 1; i 1 i < n+1 i n+1 n 1 i++ i++ i {
            System.out.println(ans.get(i));
        } {
            System.out.println(ans.get(i));
        } System.out.println(ans.get(i)) System.out.println System.out System System.out ans.get(i) ans.get ans i String[] args args class FastScanner {
    public static String debug = null;

    private final InputStream in = System.in;
    private int ptr = 0;
    private int buflen = 0;
    private byte[] buffer = new byte[1024];
    private boolean eos = false;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen < 0) {
                eos = true;
                return false;
            } else if (buflen == 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
    }

    public boolean isEOS() {
        return this.eos;
    }

    public boolean hasNext() {
        skipUnprintable();
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
              n *= 10;
              n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        return (int) nextLong();
    }

    public long[] nextLongList(int n) {
        return nextLongTable(1, n)[0];
    }

    public int[] nextIntList(int n) {
        return nextIntTable(1, n)[0];
    }

    public long[][] nextLongTable(int n, int m) {
        long[][] ret = new long[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        }
        return ret;
    }

    public int[][] nextIntTable(int n, int m) {
        int[][] ret = new int[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        }
        return ret;
    }
} FastScanner public static String debug = null; debug null private final InputStream in = System.in; in System.in System System.in private int ptr = 0; ptr 0 private int buflen = 0; buflen 0 private byte[] buffer = new byte[1024]; buffer new byte[1024] 1024 private boolean eos = false; eos false private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen < 0) {
                eos = true;
                return false;
            } else if (buflen == 0) {
                return false;
            }
        }
        return true;
    } hasNextByte {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen < 0) {
                eos = true;
                return false;
            } else if (buflen == 0) {
                return false;
            }
        }
        return true;
    } if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen < 0) {
                eos = true;
                return false;
            } else if (buflen == 0) {
                return false;
            }
        } ptr < buflen ptr buflen {
            return true;
        } return true; true {
            ptr = 0;
            try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen < 0) {
                eos = true;
                return false;
            } else if (buflen == 0) {
                return false;
            }
        } ptr = 0 ptr 0 try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            } catch (IOException e) {
                e.printStackTrace();
            } IOException e {
                e.printStackTrace();
            } e.printStackTrace() e.printStackTrace e {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                } debug != null debug null {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } buflen = debug.length() buflen debug.length() debug.length debug buffer = debug.getBytes() buffer debug.getBytes() debug.getBytes debug debug = "" debug "" eos = true eos true {
                    buflen = in.read(buffer);
                } buflen = in.read(buffer) buflen in.read(buffer) in.read in buffer if (buflen < 0) {
                eos = true;
                return false;
            } else if (buflen == 0) {
                return false;
            } buflen < 0 buflen 0 {
                eos = true;
                return false;
            } eos = true eos true return false; false if (buflen == 0) {
                return false;
            } buflen == 0 buflen 0 {
                return false;
            } return false; false return true; true private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    } readByte {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    } if (hasNextByte())
            return buffer[ptr++];
        else
            return -1; hasNextByte() hasNextByte return buffer[ptr++]; buffer[ptr++] buffer ptr++ ptr return -1; -1 1 private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    } isPrintableChar {
        return 33 <= c && c <= 126;
    } return 33 <= c && c <= 126; 33 <= c && c <= 126 33 <= c 33 c c <= 126 c 126 int c c private void skipUnprintable() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
    } skipUnprintable {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
    } while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++; hasNextByte() && !isPrintableChar(buffer[ptr]) hasNextByte() hasNextByte !isPrintableChar(buffer[ptr]) isPrintableChar(buffer[ptr]) isPrintableChar buffer[ptr] buffer ptr ptr++ ptr public boolean isEOS() {
        return this.eos;
    } isEOS {
        return this.eos;
    } return this.eos; this.eos this this.eos public boolean hasNext() {
        skipUnprintable();
        return hasNextByte();
    } hasNext {
        skipUnprintable();
        return hasNextByte();
    } skipUnprintable() skipUnprintable return hasNextByte(); hasNextByte() hasNextByte public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    } next {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    } if (!hasNext())
            throw new NoSuchElementException(); !hasNext() hasNext() hasNext throw new NoSuchElementException(); new NoSuchElementException() StringBuilder sb = new StringBuilder(); sb new StringBuilder() int b = readByte(); b readByte() readByte while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        } isPrintableChar(b) isPrintableChar b {
            sb.appendCodePoint(b);
            b = readByte();
        } sb.appendCodePoint(b) sb.appendCodePoint sb b b = readByte() b readByte() readByte return sb.toString(); sb.toString() sb.toString sb public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
              n *= 10;
              n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    } nextLong {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
              n *= 10;
              n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    } if (!hasNext())
            throw new NoSuchElementException(); !hasNext() hasNext() hasNext throw new NoSuchElementException(); new NoSuchElementException() long n = 0; n 0 boolean minus = false; minus false int b = readByte(); b readByte() readByte if (b == '-') {
            minus = true;
            b = readByte();
        } b == '-' b '-' {
            minus = true;
            b = readByte();
        } minus = true minus true b = readByte() b readByte() readByte if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        } b < '0' || '9' < b b < '0' b '0' '9' < b '9' b {
            throw new NumberFormatException();
        } throw new NumberFormatException(); new NumberFormatException() while (true) {
            if ('0' <= b && b <= '9') {
              n *= 10;
              n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        } true {
            if ('0' <= b && b <= '9') {
              n *= 10;
              n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        } if ('0' <= b && b <= '9') {
              n *= 10;
              n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            } '0' <= b && b <= '9' '0' <= b '0' b b <= '9' b '9' {
              n *= 10;
              n += b - '0';
            } n *= 10 n 10 n += b - '0' n b - '0' b '0' if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            } b == -1 || !isPrintableChar(b) b == -1 b -1 1 !isPrintableChar(b) isPrintableChar(b) isPrintableChar b {
                return minus ? -n : n;
            } return minus ? -n : n; minus ? -n : n minus -n n n {
                throw new NumberFormatException();
            } throw new NumberFormatException(); new NumberFormatException() b = readByte() b readByte() readByte public int nextInt() {
        return (int) nextLong();
    } nextInt {
        return (int) nextLong();
    } return (int) nextLong(); (int) nextLong() nextLong public long[] nextLongList(int n) {
        return nextLongTable(1, n)[0];
    } nextLongList {
        return nextLongTable(1, n)[0];
    } return nextLongTable(1, n)[0]; nextLongTable(1, n)[0] nextLongTable(1, n) nextLongTable 1 n 0 int n n public int[] nextIntList(int n) {
        return nextIntTable(1, n)[0];
    } nextIntList {
        return nextIntTable(1, n)[0];
    } return nextIntTable(1, n)[0]; nextIntTable(1, n)[0] nextIntTable(1, n) nextIntTable 1 n 0 int n n public long[][] nextLongTable(int n, int m) {
        long[][] ret = new long[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        }
        return ret;
    } nextLongTable {
        long[][] ret = new long[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        }
        return ret;
    } long[][] ret = new long[n][m]; ret new long[n][m] n m for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        } int i = 0; int i = 0; i 0 i < n i n i ++ i ++ i {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        } {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        } for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            } int j = 0; int j = 0; j 0 j < m j m j ++ j ++ j {
                ret[i][j] = nextLong();
            } {
                ret[i][j] = nextLong();
            } ret[i][j] = nextLong() ret[i][j] ret[i] ret i j nextLong() nextLong return ret; ret int n n int m m public int[][] nextIntTable(int n, int m) {
        int[][] ret = new int[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        }
        return ret;
    } nextIntTable {
        int[][] ret = new int[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        }
        return ret;
    } int[][] ret = new int[n][m]; ret new int[n][m] n m for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        } int i = 0; int i = 0; i 0 i < n i n i ++ i ++ i {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        } {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        } for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            } int j = 0; int j = 0; j 0 j < m j m j ++ j ++ j {
                ret[i][j] = nextInt();
            } {
                ret[i][j] = nextInt();
            } ret[i][j] = nextInt() ret[i][j] ret[i] ret i j nextInt() nextInt return ret; ret int n n int m m public class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] ab = new int[m][2];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        }
        HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>();
        for (int i = 1; i < n+1; i++) {
            ans.put(i,0);
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        }
        for (int i = 1; i < n+1; i++) {
            System.out.println(ans.get(i));
        }
    }
} public class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] ab = new int[m][2];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        }
        HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>();
        for (int i = 1; i < n+1; i++) {
            ans.put(i,0);
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        }
        for (int i = 1; i < n+1; i++) {
            System.out.println(ans.get(i));
        }
    }
} Main
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.HashMap;


public class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] ab = new int[m][2];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                ab[i][j] = sc.nextInt();
            }
        }
        HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>();
        for (int i = 1; i < n+1; i++) {
            ans.put(i,0);
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 2; j++) {
                if (ans.containsKey(ab[i][j])) {
                    int tmp = ans.get(ab[i][j]);
                    ans.put(ab[i][j], tmp+1);
                }
            }
        }
        for (int i = 1; i < n+1; i++) {
            System.out.println(ans.get(i));
        }
    }
}


class FastScanner {
    public static String debug = null;

    private final InputStream in = System.in;
    private int ptr = 0;
    private int buflen = 0;
    private byte[] buffer = new byte[1024];
    private boolean eos = false;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen < 0) {
                eos = true;
                return false;
            } else if (buflen == 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
    }

    public boolean isEOS() {
        return this.eos;
    }

    public boolean hasNext() {
        skipUnprintable();
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
              n *= 10;
              n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        return (int) nextLong();
    }

    public long[] nextLongList(int n) {
        return nextLongTable(1, n)[0];
    }

    public int[] nextIntList(int n) {
        return nextIntTable(1, n)[0];
    }

    public long[][] nextLongTable(int n, int m) {
        long[][] ret = new long[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        }
        return ret;
    }

    public int[][] nextIntTable(int n, int m) {
        int[][] ret = new int[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        }
        return ret;
    }
}
