import std.stdio;
import std.string;
import std.format;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.concurrency;
import std.traits;
import std.uni;
import std.regex;
import core.bitop : popcnt;
alias Generator = std.concurrency.Generator;

enum long INF = long.max/5;
enum long MOD = 10L^^9+7;

void main() {
  long N, M, K;
  scanln(N, M, K);

  auto qf = QuickFind(N);

  struct P {
    long a, b;
  }
  struct Q {
    long c, d;
  }
  P[] ps = new P[M];
  Q[] qs = new Q[K];
  foreach(ref p; ps) {
    scanln(p.a, p.b);
    p.a--;
    p.b--;
    qf.unite(p.a, p.b);
  }

  foreach(ref q; qs) {
    scanln(q.c, q.d);
    q.c--;
    q.d--;
  }

  long[] xs = new long[N];
  foreach(i; 0..N) {
    xs[i] += qf.getSet(i).length - 1;
  }
  foreach(p; ps) {
    if (qf.same(p.a, p.b)) {
      xs[p.a]--;
      xs[p.b]--;
    }
  }
  foreach(q; qs) {
    if (qf.same(q.c, q.d)) {
      xs[q.c]--;
      xs[q.d]--;
    }
  }
  xs.map!(to!string).join(" ").writeln;
}

struct QuickFind {

private:
  size_t[] i2g;
  size_t[][] gs;

public:
  this(size_t size) {
    init(size);
  }

  void init(size_t size) {
    gs.length = size;
    i2g.length = size;
    foreach(i; 0..size) {
      gs[i] = [i];
      i2g[i] = i;
    }
  }

  void unite(size_t x, size_t y) {
    if (gs[i2g[x]].length < gs[i2g[y]].length) {
      swap(x, y);
    }
    size_t gx = i2g[x], gy = i2g[y];
    if (gx == gy) return;
    foreach(i; gs[gy]) {
      i2g[i] = gx;
    }
    gs[gx] ~= gs[gy];
    gs[gy].length = 0;
  }

  bool same(size_t x, size_t y) {
    return findSet(x) == findSet(y);
  }

  size_t findSet(size_t index) {
    return i2g[index];
  }

  bool isRoot(size_t index) {
    return findSet(index) == index;
  }

  size_t[] getSet(size_t index) {
    return gs[findSet(index)];
  }

  size_t[][] getAllSet() {
    return gs;
  }
}


// ----------------------------------------------


void times(alias fun)(long n) {
  // n.iota.each!(i => fun());
  foreach(i; 0..n) fun();
}
auto rep(alias fun, T = typeof(fun()))(long n) {
  // return n.iota.map!(i => fun()).array;
  T[] res = new T[n];
  foreach(ref e; res) e = fun();
  return res;
}

T ceil(T)(T x, T y) if (isIntegral!T || is(T == BigInt)) {
  // `(x+y-1)/y` will only work for positive numbers ...
  T t = x / y;
  if (y > 0 && t * y < x) t++;
  if (y < 0 && t * y > x) t++;
  return t;
}

T floor(T)(T x, T y) if (isIntegral!T || is(T == BigInt)) {
  T t = x / y;
  if (y > 0 && t * y > x) t--;
  if (y < 0 && t * y < x) t--;
  return t;
}

ref T ch(alias fun, T, S...)(ref T lhs, S rhs) {
  return lhs = fun(lhs, rhs);
}
unittest {
  long x = 1000;
  x.ch!min(2000);
  assert(x == 1000);
  x.ch!min(3, 2, 1);
  assert(x == 1);
  x.ch!max(100).ch!min(1000); // clamp
  assert(x == 100);
  x.ch!max(0).ch!min(10); // clamp
  assert(x == 10);
}

mixin template Constructor() {
  import std.traits : FieldNameTuple;
  this(Args...)(Args args) {
    // static foreach(i, v; args) {
    foreach(i, v; args) {
      mixin("this." ~ FieldNameTuple!(typeof(this))[i]) = v;
    }
  }
}

void scanln(Args...)(auto ref Args args) {
  enum sep = " ";
  enum n = Args.length;
  enum fmt = n.rep!(()=>"%s").join(sep);

  string line = readln.chomp;
  static if (__VERSION__ >= 2074) {
    line.formattedRead!fmt(args);
  } else {
    enum argsTemp = n.iota.map!(
      i => "&args[%d]".format(i)
    ).join(", ");
    mixin(
      "line.formattedRead(fmt, " ~ argsTemp ~ ");"
    );
  }
}

// fold was added in D 2.071.0
static if (__VERSION__ < 2071) {
  template fold(fun...) if (fun.length >= 1) {
    auto fold(R, S...)(R r, S seed) {
      static if (S.length < 2) {
        return reduce!fun(seed, r);
      } else {
        return reduce!fun(tuple(seed), r);
      }
    }
  }
}

// popcnt with ulongs was added in D 2.071.0
static if (__VERSION__ < 2071) {
  ulong popcnt(ulong x) {
    x = (x & 0x5555555555555555L) + (x>> 1 & 0x5555555555555555L);
    x = (x & 0x3333333333333333L) + (x>> 2 & 0x3333333333333333L);
    x = (x & 0x0f0f0f0f0f0f0f0fL) + (x>> 4 & 0x0f0f0f0f0f0f0f0fL);
    x = (x & 0x00ff00ff00ff00ffL) + (x>> 8 & 0x00ff00ff00ff00ffL);
    x = (x & 0x0000ffff0000ffffL) + (x>>16 & 0x0000ffff0000ffffL);
    x = (x & 0x00000000ffffffffL) + (x>>32 & 0x00000000ffffffffL);
    return x;
  }
}
