package main

import (
	"bufio"
	"fmt"
	"log"
	"math"
	"os"
	"strconv"
	"strings"
)

const (
	TooLarge = math.MaxInt64
	TooSmall = math.MinInt64
)

func nextInt(sc *bufio.Scanner) int {
	if !sc.Scan() {
		panic(nil)
	}
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	sc := bufio.NewScanner(os.Stdin)
	buf := make([]byte, 1024)
	sc.Buffer(buf, 1e+7)
	sc.Split(bufio.ScanWords)
	n := nextInt(sc)
	m := nextInt(sc)
	k := nextInt(sc)
	// scanner := makeWordScanner()
	// n := eGetInt(scanner)
	// m := eGetInt(scanner)
	// k := eGetInt(scanner)
	friends := make([][]int, n+1)
	blocks := make([][]int, n+1)
	answer := make([]int, n+1)
	for i := 1; i < n+1; i++ {
		// friends[i] = make([]int, 0, n+1)
		// blocks[i] = make([]int, 0, n+1)
		friends[i] = []int{}
		blocks[i] = []int{}
		answer[i] = -1
	}
	for i := 0; i < m; i++ {
		a := nextInt(sc)
		b := nextInt(sc)
		friends[a] = append(friends[a], b)
		friends[b] = append(friends[b], a)
	}
	for i := 0; i < k; i++ {
		c := nextInt(sc)
		d := nextInt(sc)
		blocks[c] = append(blocks[c], d)
		blocks[d] = append(blocks[d], c)
	}
	for i := 1; i < n+1; i++ {

		if answer[i] != -1 {
			continue
		}

		visited := make(map[int]bool)
		var dfs func(int)
		union := make([]int, 0)
		dfs = func(n int) {
			// fmt.Println(i, n)
			visited[n] = true
			union = append(union, n)
			for _, f := range friends[n] {
				if !visited[f] {
					dfs(f)
				}
			}
		}
		dfs(i)
		// fmt.Println(i, union)

		for j := 0; j < len(union); j++ {
			// fmt.Println(i, union[j])
			answer[union[j]] = len(union)
			answer[union[j]] -= 1
			answer[union[j]] -= len(friends[union[j]])
			blen := 0
			for _, b := range blocks[union[j]] {
				if visited[b] {
					blen++
				}
			}
			answer[union[j]] -= blen
		}
		// fmt.Println(answer)
		// fmt.Println(union)
	}
	// for i := 1; i < n+1; i++ {
	// 	fmt.Println(friends[i])
	// }
	s := fmt.Sprint(answer[1:])
	fmt.Println(s[1 : len(s)-1])
}

func contains(n int, a []int) bool {
	for _, v := range a {
		if n == v {
			return true
		}
	}
	return false
}

////////////////////////////////////////////////////////////////////////////////
// ライブラリ
////////////////////////////////////////////////////////////////////////////////
func makeScanner(maxByte int) *bufio.Scanner {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Buffer(make([]uint8, 0, 8192), maxByte)
	return scanner
}
func makeCharScanner() *bufio.Scanner {
	scanner := makeScanner(8192)
	scanner.Split(bufio.ScanRunes)
	return scanner
}
func makeWordScanner() *bufio.Scanner {
	scanner := makeScanner(8192)
	scanner.Split(bufio.ScanWords)
	return scanner
}
func eGetLine(r *bufio.Scanner) string {
	if r.Scan() {
		return r.Text()
	}
	err := r.Err()
	if err != nil {
		log.Fatal(err)
	}
	// EOF
	return ""
}
func eGetInt(r *bufio.Scanner) int {
	line := eGetLine(r)
	return eAtoi(line)
}
func eGetInt64(r *bufio.Scanner) int64 {
	line := eGetLine(r)
	return eAtoInt64(line)
}
func eGetFields(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Fields(line)
}
func eGetInts(r *bufio.Scanner) []int {
	fields := eGetFields(r)
	ints := make([]int, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoi(fields[i])
	}
	return ints
}
func eGetInt64s(r *bufio.Scanner) []int64 {
	fields := eGetFields(r)
	ints := make([]int64, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoInt64(fields[i])
	}
	return ints
}
func eGetChars(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Split(line, "")
}
func eAtoi(s string) int {
	n, err := strconv.Atoi(s)
	if err != nil {
		log.Fatal(err)
	}
	return n
}
func eAtoInt64(s string) int64 {
	n, err := strconv.ParseInt(s, 10, 64)
	if err != nil {
		log.Fatal(err)
	}
	return n
}
func pow(a, n int) int {
	if n == 0 {
		return 1
	}
	if n == 1 {
		return a
	}
	if n%2 == 1 {
		return pow((a*a), n/2) * a
	}
	return pow((a * a), n/2)
}
func powMod(a, n, mod int) int {
	if n == 0 {
		return 1 % mod
	}
	if n == 1 {
		return a % mod
	}
	if n%2 == 1 {
		return powMod((a*a)%mod, n/2, mod) * a % mod
	}
	return powMod((a*a)%mod, n/2, mod)
}

func factoricalMod(n, count, mod int) int {
	if count == 1 {
		return n % mod
	}
	return (n % mod) * (factoricalMod(n-1, count-1, mod)) % mod
}

func combinationMod(n, a, mod int) int {
	x := factoricalMod(n, a, mod)
	y := factoricalMod(a, a, mod)
	y = powMod(y, mod-2, mod)
	return ((x % mod) * (y % mod)) % mod
}
func countBitOfOn(i, numbits int) int {
	count := 0
	var bit uint64
	for bit = 0; bit < uint64(numbits); bit++ {
		t := 1 << bit
		if i&t > 0 {
			count++
		}
	}
	return count
}


Measured memory_bytes: 29440