import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.NoSuchElementException;

public class Main {
    public static void main(String[] args) {
        // var sc = new FastScanner();
        var pw = new FastPrintWriter();
        // final int N = sc.nextInt();
        // final int Q = sc.nextInt();
        // final var A = new long[N];
        // java.util.Arrays.setAll(A, i -> sc.nextInt());
        // var t = new FenwickTree(A);
        // for (int $ = 0; $ < Q; $++) {
        //     int query = sc.nextInt();
        //     if (query == 0) {
        //         int p = sc.nextInt();
        //         int x = sc.nextInt();
        //         t.add(p, x);
        //     } else {
        //         int l = sc.nextInt();
        //         int r = sc.nextInt();
        //         pw.println(t.sum(l, r));
        //     }
        // }
        // pw.flush();
        // pw.close();
        FastScanner fsc = new FastScanner();
        int n = fsc.nextInt();
        int m = fsc.nextInt();
        int k = fsc.nextInt();
        HashSet<Integer>[] friend = new HashSet[n];
        HashSet<Integer>[] block = new HashSet[n];
        for (int i = 0; i < n; i++) {
            block[i] = new HashSet<>();
            friend[i] = new HashSet<>();
        }
        UnionFindTree t = new UnionFindTree(n);
        for (int i = 0; i < m; i++) {
            int a = fsc.nextInt() - 1;
            int b = fsc.nextInt() - 1;
            friend[a].add(b);
            friend[b].add(a);
            t.unite(a, b);
        }
        for (int i = 0; i < k; i++) {
            int c = fsc.nextInt() - 1;
            int d = fsc.nextInt() - 1;
            if (t.root(c) == t.root(d)) {
                block[c].add(d);
                block[d].add(c);
            }
        }
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < n; i++) {
            if (!map.containsKey(t.root(i))) {
                map.put(t.root(i), 1);
            } else {
                map.put(t.root(i), map.get(t.root(i)) + 1);
            }
        }
        for (int i = 0; i < n; i++) {
            pw.print(map.get(t.root(i)) - block[i].size() - friend[i].size() - 1);
            pw.write(' ');
        }
        pw.flush();
        pw.close();
    }

    static class UnionFindTree {
        private int[] parent;
        private int[] rank;
        private int[] size;
        private int groups;
     
        public UnionFindTree(int n) {
            this.parent = new int[n];
            this.rank = new int[n];
            this.size = new int[n];
            this.groups = n;
            Arrays.fill(this.size, 1);
            for (int i = 0; i < n; i++) {
                parent[i] = i;
            }
        }
     
        public int root(int x) {
            if (parent[x] == x) {
                return x;
            }
            return parent[x] = root(parent[x]);
        }
     
        public boolean isSame(int x, int y) {
            return root(x) == root(y);
        }
     
        public void unite(int x, int y) {
            int xr = root(x);
            int yr = root(y);
            if (xr == yr) {
                return;
            }
            if (rank[xr] < rank[yr]) {
                parent[xr] = yr;
                size[yr] += size[xr];
            } else {
                parent[yr] = xr;
                size[xr] += size[yr];
                if (rank[xr] == rank[yr]) {
                    rank[xr]++;
                }
            }
            groups--;
        }
     
        public int size(int x) {
            return size[root(x)];
        }
     
        public boolean isRoot(int x) {
            return parent[x] == x;
        }
     
        public int groups() {
            return groups;
        }
    }

    static class FastPrintWriter extends java.io.PrintWriter {
        private static final long[] pow10l = new long[19];
        private static final int[] pow10i = new int[10];
        static {
            long ten = 1;
            for (int i = 0; i <= 9; i++) {
                pow10i[i] = (int) ten;
                pow10l[i] = ten;
                ten *= 10;
            }
            for (int i = 10; i <= 18; i++) {
                pow10l[i] = ten;
                ten *= 10;
            }
        }

        public FastPrintWriter(java.io.Writer out) {
            super(out);
        }

        public FastPrintWriter(java.io.File file) throws java.io.FileNotFoundException {
            super(new java.io.FileOutputStream(file));
        }

        public FastPrintWriter(String filename) throws java.io.FileNotFoundException {
            super(new java.io.File(filename));
        }

        public FastPrintWriter() {
            super(System.out);
        }

        @Override
        public void print(int x) {
            if (x == 0) {
                write('0');
                return;
            }
            int d = stringSize(x);
            if (x < 0) {
                write('-');
                x = -x;
                d--;
            }
            for (int j = d - 1; j >= 0; j--) {
                int p = x / pow10i[j];
                write((char) ('0' + p));
                x -= p * pow10i[j];
            }
        }
        @Override
        public void print(long x) {
            if (x == 0) {
                write('0');
                return;
            }
            int d = stringSize(x);
            if (x < 0) {
                write('-');
                x = -x;
                d--;
            }
            for (int j = d - 1; j >= 0; j--) {
                long p = x / pow10i[j];
                write((char) ('0' + p));
                x -= p * pow10i[j];
            }
        }

        private static int stringSize(int x) {
            int d = 1;
            if (x >= 0) {d = 0; x = -x;}
            int p = -10;
            for (int i = 1; i < 10; i++, p *= 10) if (x > p) return i + d;
            return 10 + d;
        }

        private static int stringSize(long x) {
            int d = 1;
            if (x >= 0) {d = 0; x = -x;}
            long p = -10;
            for (int i = 1; i < 19; i++, p *= 10) if (x > p) return i + d;
            return 19 + d;
        }
    }

    static class FenwickTree {
        final int N;
        final long[] Dat;
    
        public FenwickTree(int n) {
            this.N = n;
            this.Dat = new long[N + 1];
        }
    
        public FenwickTree(long[] dat) {
            this(dat.length);
            System.arraycopy(dat, 0, Dat, 1, N);
            for (int i = 1; i <= N; i++) {
                int p = i + (i & -i);
                if (p <= N) Dat[p] += Dat[i];
            }
        }
    
        public void add(int p, long x) {
            p++;
            while (p <= N) {
                Dat[p] += x;
                p += p & -p;
            }
        }
    
        public long sum(int l, int r) {
            return sum(r) - sum(l);
        }
    
        private long sum(int r) {
            long s = 0;
            while (r > 0) {
                s += Dat[r];
                r -= r & -r;
            }
            return s;
        }
    }

    static class FastScanner {
        private final java.io.InputStream in;
        private final byte[] buf = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;
        public FastScanner(java.io.InputStream in) {this.in = in;}
        public FastScanner() {this(System.in);}
        private boolean hasNextByte() {
            if (ptr < buflen) return true;
            ptr = 0;
            try {buflen = in.read(buf);}
            catch (java.io.IOException e) {e.printStackTrace();}
            return buflen > 0;
        }
        private int readByte() {return hasNextByte() ? buf[ptr++] : -1;}
        public boolean hasNext() {
            while (hasNextByte() && !(33 <= buf[ptr] && buf[ptr] <= 126)) ptr++;
            return hasNextByte();
        }
        private StringBuilder nextSequence() {
            if (!hasNext()) throw new NoSuchElementException();
            final StringBuilder sb = new StringBuilder();
            int b = readByte();
            while (33 <= b && b <= 126) {sb.appendCodePoint(b); b = readByte();}
            return sb;
        }
        public String next() {
            return nextSequence().toString();
        }
        public String next(int len) {
            return new String(nextChars(len));
        }
        public char[] nextChars() {
            final StringBuilder sb = nextSequence();
            int l = sb.length();
            char[] dst = new char[l];
            sb.getChars(0, l, dst, 0);
            return dst;
        }
        public char[] nextChars(int len) {
            if (!hasNext()) throw new NoSuchElementException();
            char[] s = new char[len];
            int i = 0;
            int b = readByte();
            while (33 <= b && b <= 126 && i < len) {s[i++] = (char) b; b = readByte();}
            if (i != len) throw new NoSuchElementException(String.format("length %d is longer than the sequence.", len));
            return s;
        }
        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 = n * 10 + b - '0';
                else if (b == -1 || !(33 <= b && b <= 126)) return minus ? -n : n;
                else throw new NumberFormatException();
                b = readByte();
            }
        }
        public int nextInt() {return Math.toIntExact(nextLong());}
        public double nextDouble() {return Double.parseDouble(next());}
    }
}


Measured memory_bytes: 107024