using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

partial class Solver {
    public void Run() {
        var n = ni();
        var m = ni();
        var k = ni();
        var a = new int[m];
        var b = new int[m];
        for (int i = 0; i < m; i++) {
            a[i] = ni() - 1;
            b[i] = ni() - 1;
        }
        var c = new int[k];
        var d = new int[k];
        for (int i = 0; i < k; i++) {
            c[i] = ni() - 1;
            d[i] = ni() - 1;
        }
        var adj = Enumerable.Range(0, n).Select(_ => new HashSet<int>()).ToArray();
        var adjBlock = Enumerable.Range(0, n).Select(_ => new List<int>()).ToArray();

        var D = new DisjointSet(n);
        for (int i = 0; i < m; i++) {
            adj[a[i]].Add(b[i]);
            adj[b[i]].Add(a[i]);
            D.Unite(a[i], b[i]);
        }

        for (int i = 0; i < k; i++) {
            adjBlock[c[i]].Add(d[i]);
            adjBlock[d[i]].Add(c[i]);
        }

        var ans = new List<int>();
        for (int i = 0; i < n; i++) {
            var cand = D.Size(i) - 1;
            cand -= adj[i].Count; // friend
            foreach (var x in adjBlock[i]) {
                if (adj[i].Contains(x)) continue;
                if (D.IsSameSet(i, x)) {
                    cand--;
                }
            }
            ans.Add((int)cand);
        }
        cout.WriteLine(string.Join(" ", ans));
    }
}

public class DisjointSet {
    private readonly long[] group;
    public int GroupCount { get; private set; }
    public DisjointSet(int n, int[] size = null) {
        group = new long[n];
        Clear(size);
        GroupCount = n;
    }
    public bool Unite(int x, int y) {
        x = Root(x); y = Root(y);
        if (x == y) {
            return false;
        }

        if (group[y] < group[x]) {
            return Unite(y, x);
        }

        group[x] += group[y];
        group[y] = x;
        GroupCount--;
        return true;
    }
    public bool IsSameSet(int x, int y) { return Root(x) == Root(y); }
    public int Root(int x) { return group[x] < 0 ? x : (int)(group[x] = Root((int)group[x])); }
    public long Size(int x) { return -group[Root(x)]; }
    public void Clear(int[] size = null) {
        for (int i = 0; i < group.Length; i++) {
            group[i] = -(size == null ? 1 : size[i]);
        }
    }
};

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}


Measured memory_bytes: 58444