# Original solution
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

class UnionFind_size:
    def __init__(self, n):
        # 初期状態は全要素が根なので、親は自分自身
        self.par = [i for i in range(n+1)]
        # 集団の要素数(size)を格納する(初期は全て1)
        self.size = [1] * (n+1)
    
    # 根を検索する関数
    def find(self, x):
        # 根までたどったらその番号を返す
        if self.par[x] == x:
            return x
        # 根でないなら親の要素で再検索
        else:
            # 検索過程で親を書き換える(圧縮経路)
            self.par[x] = self.find(self.par[x])
            return self.find(self.par[x])
  
    # 結合(unite)する関数
    def unite(self, x, y):
        # 根を探す
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        # サイズを比較し、小さい方を大きい方に繋げる
        if self.size[x] < self.size[y]:
            self.par[x] = y
            self.size[y] += self.size[x]
        else:
            self.par[y] = x
            self.size[x] += self.size[y]
           
    # 同じグループに属するかを判定する関数
    def same_check(self, x, y):
        return self.find(x) == self.find(y)
    
    # 要素が属する木のサイズを返す関数
    def get_size(self, x):
        return self.size[self.find(x)]
    
    # グループ数を返す関数
    def group_sum(self):
        c = 0
        for i in range(len(self.par)):
            if self.find(i) == i:
                c += 1
        return c


def main():
    N,M,K = list(map(int, readline().split()))

    uf = UnionFind_size(N+1)
    F = [[] for _ in range(N+1)]
    for _ in range(M):
        a,b = list(map(int, readline().split()))
        F[a].append(b)
        F[b].append(a)
        uf.unite(a, b)
    
    B = [[] for _ in range(N+1)]
    for _ in range(K):
        c,d = list(map(int, readline().split()))
        B[c].append(d)
        B[d].append(c)


    ans = []
    for i in range(1,N+1):
        tmp = 0
        tmp += uf.get_size(i) - 1
        tmp -= len(F[i])
        for j in B[i]:
            if uf.same_check(i, j):
                tmp -= 1
        ans.append(tmp)
    
    print((" ".join(map(str, ans))))


if __name__ == "__main__":
    main()


# Optimized solution
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines


def main():
    N,M,K = list(map(int, readline().split()))

    F = [[] for _ in range(N+1)]
    for _ in range(M):
        a,b = list(map(int, readline().split()))
        F[a].append(b)
        F[b].append(a)
    
    B = [[] for _ in range(N+1)]
    for _ in range(K):
        c,d = list(map(int, readline().split()))
        B[c].append(d)
        B[d].append(c)


    seen = [-1]*(N+1)
    group = 0
    def dfs(G, s):
        stack = [s]
        seen[s] = group
        n_connection = 1 
        
        while stack:
            u = stack.pop()
            for v in G[u]:
                if seen[v] == -1:
                    n_connection += 1
                    seen[v] = group
                    stack.append(v)
    
        return n_connection


    union = {}
    for i in range(1,N+1):
        if seen[i] == -1:
            n = dfs(F, i)
            union[group] = n
            group += 1
            
    ans = []
    for i in range(1,N+1):
        tmp = 0
        tmp += union[seen[i]] - 1
        tmp -= len(F[i])
        for j in B[i]:
            if seen[j] == seen[i]:
                tmp -= 1
        ans.append(tmp)
    
    print((" ".join(map(str, ans))))


if __name__ == "__main__":
    main()