### BUGGY CODE ###

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
    
from collections import defaultdict
n,m,k=map(int,input().split())
tree = UnionFind(n)
friend=defaultdict(set)
block =defaultdict(set)
for _ in range(m):
    a,b=map(int,input().split())
    tree.union(a-1,b-1)
    friend[a-1].add(b-1)
    friend[b-1].add(a-1)
for _ in range(k):
    a,b=map(int,input().split())
    block[a-1].add(b-1)
    block[b-1].add(a-1)
    
ans=[]
for i in range(n):
    #print(set(tree.members(i)),friend[i],block[i])
    g = set(tree.members(i)) - friend[i] - block[i]
    #print(g)
    l = len(g)
    ans.append(l-1)
print(*ans)

### FIXED CODE ###

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
    
from collections import defaultdict
n,m,k=map(int,input().split())
tree = UnionFind(n)
friend=defaultdict(int)
block =defaultdict(int)

ab=[]
for _ in range(m):
    a,b=map(int,input().split())
    ab.append((a,b))
    
for a,b in ab:
    tree.union(a-1,b-1)
    
for a,b in ab:
    if tree.same(a-1,b-1):
        friend[a-1] +=1
        friend[b-1] +=1
    
for _ in range(k):
    c,d=map(int,input().split())
    if tree.same(c-1,d-1):
        block[c-1] +=1
        block[d-1] +=1
    
ans=[]
for i in range(n):
    l = tree.size(i) - block[i]  - friend[i]
    ans.append(l-1)
print(*ans)