// C++ 14
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <math.h>
#include <cstring>
#include <bitset>

#define ll long long
#define Int ll
#define loop(__x, __start, __end) for(Int __x = __start; __x < __end; __x++)
#define loopdown(__x, __start, __end) for(Int __x = __start; __x > __end; __x--)
#define rep(__n) for(Int __x = 0; __x < __n; __x++)
#define span(__a,__x,__y) __a.begin()+__x,__a.begin()+__y
#define span_all(__a) __a.begin(),__a.end()
#define len(__x) (__x.size())
#define last(__x) (__x[__x.size()-1])
#define endl '\n'

using namespace std;

struct Point {
  Int x, y;
  Point(Int x, Int y): x(x), y(y) {}
  Point(): x(0), y(0) {}

  Point operator + (Point v) { return Point(x + v.x, y + v.y); }
  Point operator - (Point v) { return Point(x - v.x, y - v.y); }
  bool operator == (const Point &v) const {
    return x == v.x && y == v.y;
  }
  bool operator< (const Point &p1) const {
    return x < p1.x && y < p1.y;
  }
};
ostream & operator << (ostream & out, Point const & v) {
  out << "Point(" << v.x << ", " << v.y << ')';
  return out;
}

istream & operator >> (istream & in, Point & v) {
  Int x, y;
  in >> x; in >> y; v.x = x; v.y = y;
  return in;
}

// Geometry

#define EPS 0.0000000001

class Vector2 {
public:
  double x, y;
  
  Vector2(double x = 0, double y = 0): x(x), y(y) {}
  
  Vector2 operator + (Vector2 v) { return Vector2(x + v.x, y + v.y); }
  Vector2 operator - (Vector2 v) { return Vector2(x - v.x, y - v.y); }
  Vector2 operator * (double k) { return Vector2(x * k, y * k); }
  Vector2 operator / (double k) { return Vector2(x / k, y / k); }
  
  double length() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  double dot (Vector2 v) { return x * v.x + y * v.y; }
  double cross (Vector2 v) { return x * v.y - y * v.x; }
  
  bool operator < (const Vector2 &v) const {
    return x != v.x ? x < v.x : y < v.y;
  }
  
  bool operator == (const Vector2 &v) const {
    return fabs(x - v.x) < EPS && fabs(y - v.y) < EPS;
  }
};

ostream & operator << (ostream & out, Vector2 const & v) { 
  out<< "Vector2(" << v.x << ", " << v.y << ')';
  return out;
}

istream & operator >> (istream & in, Vector2 & v) { 
  double x, y;
  in >> x;
  in >> y;
  v.x = x;
  v.y = y;
  return in;
}

class DisjointSet {
public:
    DisjointSet(Int n) {
        rank.resize(n);
        parent.resize(n);
        sizes.resize(n);
        for (Int i=0; i<n; i++) rank[i] = 0, parent[i] = i, sizes[i] = 1;
    }

    bool same(Int x, Int y) {
        return root(x) == root(y);
    }

    void unite(Int x, Int y) {
        x = root(x), y = root(y);
        if (x == y) return;
        if (rank[x] < rank[y]) swap(x, y);
        else if (rank[x] == rank[y]) rank[x]++;
        parent[y] = x;
        sizes.at(x) += sizes.at(y);
    }

    Int size(Int x) {
      return sizes.at(root(x));
    }

private:
    vector<Int> rank;
    vector<Int> parent;
    vector<ll> sizes;

    Int root(Int x) {
        if (x != parent[x]) {
            parent[x] = root(parent[x]);
        }

        return parent[x];
    }
};

const Int MAX_N = 100001;
// 人数, 友達, ブロック
Int N, M, K;
Int A[MAX_N], B[MAX_N], C[MAX_N], D[MAX_N], ans[MAX_N];

void input() {
  cin >> N >> M >> K;
  Int a, b;
  loop(i,0,M) {
    cin >> a >> b;
    a--;b--;
    A[i] = a;
    B[i] = b;
  }
  loop(i,0,K) {
    cin >> a >> b;
    a--;b--;
    C[i] = a;
    D[i] = b;
  }
}

void solve() {
  DisjointSet dset(N);

  // つながれる友達同士をグループ化
  loop(i,0,M) {
    dset.unite(A[i], B[i]);
  }

  // 人ごとに所属するグループメンバー数（自分を除く）をカウント
  loop(i,0,N) {
    ans[i] = dset.size(i) - 1;
  }

  // ansですでに直接間接問わず友達の友達の数が入っている. あとは友達とブロックを引くだけ
  loop(i,0,M) { // 友達リスト走査
    if (dset.same(A[i], B[i])) {
      ans[A[i]]--;ans[B[i]]--;
    }
  }
  loop(i,0,K) { // ブロックリスト走査
    if (dset.same(C[i], D[i])) {
      ans[C[i]]--;ans[D[i]]--;
    }
  }

  loop(i,0,N) {
    if (i!=0) cout << ' ';
    cout << ans[i];
  }
  cout << endl;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  input();
  solve();
  return 0;
}


Measured memory_bytes: 7168