using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;

namespace AtCoderWorkspace
{
    public class Solver
    {
        public void Solve()
        {
            var cin = new Scanner();
            var n = cin.nextInt();
            var m = cin.nextInt();
            var k = cin.nextInt();
            var friends = new int[n];
            var uni = new UnionFind(n);
            for (int i = 0; i < m; i++)
            {
                var a = cin.nextInt();
                var b = cin.nextInt();
                friends[a - 1]++;
                friends[b - 1]++;
                uni.Unite(a-1,b-1);
            }
            var block = new int[n];
            for (int i = 0; i < k; i++)
            {
                var a = cin.nextInt();
                var b = cin.nextInt();
                if (uni.Same(a-1, b-1))
                {
                    block[a - 1]++;
                    block[b - 1]++;
                }
            }
            Console.WriteLine(string.Join(" ", Enumerable.Range(0, n).Select(i => uni.GetSize(i) - friends[i] - block[i] - 1)));
        }
    }

    class UnionFind
    {
        public int Size { get; private set; }
        public int GroupCount { get; private set; }
        public IEnumerable<int> AllRepresents => Parent.Where((x, y) => x == y);
        int[] Sizes;
        int[] Parent;
        public UnionFind(int count)
        {
            Size = count;
            GroupCount = count;
            Parent = new int[count];
            Sizes = new int[count];
            for (int i = 0; i < count; i++) Sizes[Parent[i] = i] = 1;
        }
        public bool Unite(int x, int y)
        {
            int xp = Find(x);
            int yp = Find(y);
            if (yp == xp) return false;
            if (Sizes[xp] < Sizes[yp]) { var tmp = xp; xp = yp; yp = tmp; }
            GroupCount--;
            Parent[yp] = xp;
            Sizes[xp] += Sizes[yp];
            return true;
        }
        public int GetSize(int x) => Sizes[Find(x)];
        public int Find(int x)
        {
            while (x != Parent[x]) x = (Parent[x] = Parent[Parent[x]]);
            return x;
        }
        public bool Same(int x, int y)
        {
            return Find(x) == Find(y);
        }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 20400