object Main extends App {
  val sc = new java.util.Scanner(System.in)
  val n = sc.nextInt()
  val m = sc.nextInt()
  val k = sc.nextInt()
  val uf = UnionFind(n)
  val ans = new Array[Int](n)
  for (i <- 0 until m) {
    val a = sc.nextInt() - 1
    val b = sc.nextInt() - 1
    uf.unite(a, b)
    ans(a) = ans(a) - 1
    ans(b) = ans(b) - 1
  }
  for (i <- 0 until n) {
    ans(i) = ans(i) + uf.size(i) - 1
  }
  for (i <- 0 until k) {
    val c = sc.nextInt() - 1
    val d = sc.nextInt() - 1
    if (uf.same(c, d)) {
      ans(c) = ans(c) - 1
      ans(d) = ans(d) - 1
    }
  }
  for (i <- 0 until n) {
    print(ans(i))
    if (i < n - 1) print(" ")
  }
  println()
  case class UnionFind(val n: Int) {
    val par = Array.fill(n)(-1)
    val sz = Array.fill(n)(1)
    def find(x: Int): Int = {
      if (par(x) == -1) par(x) = x
      if (par(x) != x) {
        par(x) = find(par(x))
      }
      par(x)
    }
    def unite(x: Int, y: Int): Unit = {
      val a = find(x)
      val b = find(y)
      if (a == b) return
      if (sz(a) > sz(b)) {
        sz(a) += sz(b)
        par(b) = par(a)
      } else {
        sz(b) += sz(a)
        par(a) = par(b)
      }
    }
    def same(x: Int, y: Int): Boolean = {
      find(x) == find(y)
    }
    def size(x: Int): Int = {
      sz(find(x))
    }
  }
}
