using System;
using System.Collections.Generic;

class Program
{
    static int[] bikeComp, waterComp;
    
    static void Main()
    {
        var line = Console.ReadLine().Split();
        int N = int.Parse(line[0]);
        int M = int.Parse(line[1]);
        int K = int.Parse(line[2]);

        var bikeAdj = new List<int>[N + 1];
        var waterAdj = new List<int>[N + 1];
        for (int i = 1; i <= N; i++)
        {
            bikeAdj[i] = new List<int>();
            waterAdj[i] = new List<int>();
        }

        for (int i = 0; i < M; i++)
        {
            var parts = Console.ReadLine().Split();
            int a = int.Parse(parts[0]), b = int.Parse(parts[1]);
            bikeAdj[a].Add(b);
            bikeAdj[b].Add(a);
        }
        for (int i = 0; i < K; i++)
        {
            var parts = Console.ReadLine().Split();
            int a = int.Parse(parts[0]), b = int.Parse(parts[1]);
            waterAdj[a].Add(b);
            waterAdj[b].Add(a);
        }

        bikeComp = new int[N + 1];
        waterComp = new int[N + 1];
        var bikeSize = new Dictionary<int, int>();
        var waterSize = new Dictionary<int, int>();

        // BFS to find components
        BFS(N, bikeAdj, bikeComp, bikeSize);
        BFS(N, waterAdj, waterComp, waterSize);

        // For each node, count: |bikeComp| + |waterComp| - |intersection| - 1
        // Intersection: nodes with same bikeComp AND same waterComp
        // We need to count pairs (bikeComp[i], waterComp[i]) occurrences
        var pairCount = new Dictionary<long, int>();
        for (int i = 1; i <= N; i++)
        {
            long key = (long)bikeComp[i] * 100001 + waterComp[i];
            if (!pairCount.ContainsKey(key)) pairCount[key] = 0;
            pairCount[key]++;
        }

        var result = new System.Text.StringBuilder();
        for (int i = 1; i <= N; i++)
        {
            long key = (long)bikeComp[i] * 100001 + waterComp[i];
            int bc = bikeSize[bikeComp[i]];
            int wc = waterSize[waterComp[i]];
            int inter = pairCount[key];
            int ans = bc + wc - inter - 1;
            if (i > 1) result.Append(' ');
            result.Append(ans);
        }
        Console.WriteLine(result);
    }

    static void BFS(int N, List<int>[] adj, int[] comp, Dictionary<int, int> size)
    {
        int compId = 0;
        var queue = new Queue<int>();
        for (int i = 1; i <= N; i++)
        {
            if (comp[i] == 0)
            {
                compId++;
                comp[i] = compId;
                queue.Enqueue(i);
                int cnt = 0;
                while (queue.Count > 0)
                {
                    int cur = queue.Dequeue();
                    cnt++;
                    foreach (var nb in adj[cur])
                    {
                        if (comp[nb] == 0)
                        {
                            comp[nb] = compId;
                            queue.Enqueue(nb);
                        }
                    }
                }
                size[compId] = cnt;
            }
        }
    }
}