using System;
using System.Collections.Generic;
using System.Collections;
using System.Linq;
namespace Atcoder_0404
{
    class Program
    {
        static void Main(string[] args)
        {
            var NMK = GetInput_int();
            var _humanCount = NMK[0];
            var _friendCount = NMK[1];
            var _enemyCount = NMK[2];

            List<int>[] _friendList = new List<int>[_humanCount];
            int[] _connectEnemyList = new int[_humanCount];
            for (int i = 0; i < _humanCount; i++)
            {
                _friendList[i] = new List<int>();
            }
            UnionFind uf = new UnionFind(_humanCount);
            for(int i = 0; i < _friendCount; i++)
            {
                var input = GetInput_int();
                uf.Unite(input[0]-1, input[1]-1);

                _friendList[input[0]-1].Add(input[1]-1);
                _friendList[input[1]-1].Add(input[0]-1);
            }

            for (int i = 0; i < _enemyCount; i++)
            {
                var input = GetInput_int();
                if (uf.IsSameRoot(input[0]-1, input[1]-1))
                {
                    _connectEnemyList[input[0]-1]++;
                    _connectEnemyList[input[1]-1]++;
                }
            }
            var _unionCount = new int[_humanCount];
            for(int i =0; i < _humanCount; i++)
            {

                var root= uf.Root(i);
                _unionCount[root]++;
            }
            for(int i = 0; i < _humanCount; i++)
            {
                var root=uf.Root(i);
                var result = _unionCount[root]
                    -_friendList[i].Count - _connectEnemyList[i]
                    - 1;
                Console.Write(result);
                if(i!=_humanCount-1)Console.Write(" ");
                else Console.Write("\n");
            }
        }

        
        #region input
        

        static string[] GetInput_string()
        {
            var input = Console.ReadLine().Split(' ');
            return input;
        }

        static int[] GetInput_int()
        {
            var input = GetInput_string();
            var result = new int[input.Length];
            for (int i = 0; i < result.Length; i++)
            {
                result[i] = int.Parse(input[i]);
            }
            return result;
        }
        static long[] GetInput_long()
        {
            var input = GetInput_string();
            var result = new long[input.Length];
            for (int i = 0; i < result.Length; i++)
            {
                result[i] = long.Parse(input[i]);
            }
            return result;
        }
        #endregion
        #region sonota
        static void Swap_array<T>(T[] target, int a, int b)
        {
            T temp = target[a];
            target[a] = target[b];
            target[b] = temp;
        }
        static void Swap_list<T>(List<T> target, int a, int b)
        {
            T temp = target[a];
            target[a] = target[b];
            target[b] = temp;
        }
        /// <summary>
        /// 最大公約数
        /// </summary>
        public static int GCD(int a, int b)
        {

            /* 自然数 a > b を確認・入替 */
            if (a < b)
            {
                int tmp = a;
                a = b;
                b = tmp;
            }

            /* ユークリッドの互除法 */
            int r = a % b;
            while (r != 0)
            {
                a = b;
                b = r;
                r = a % b;
            }
            return b;
        }

        /// <summary>
        /// 最小公倍数
        /// </summary>
        public static int LCM(int a, int b)
        {
            int x = a * b;
            b = GCD(a, b);
            return x / b;

        }
        #endregion

        static long mod = 1000000000 + 7;
    }

    public class UnionFind
    {
        int[] _parent;

        public UnionFind(int _edgeCount)
        {
            _parent = new int[_edgeCount];
            for(int i = 0; i < _parent.Length; i++)
            {
                _parent[i] = i;
            }
        }

        public int Root(int x)
        {
            if (_parent[x] == x)
            {
                return x;
            }
            else
            {
                _parent[x] = Root(_parent[x]);
                return _parent[x];
            }
        }

        public bool IsSameRoot(int x,int y)
        {
            return Root(x) == Root(y);
        }

        public void Unite(int x,int y)
        {
            var _xRoot = Root(x);
            var _yRoot = Root(y);
            if (_xRoot == _yRoot) return;
            _parent[_xRoot] = _yRoot;
        }
    }
}

Measured memory_bytes: 30820