#[allow(unused_imports)]
use std::char::*;
#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::*;
use std::str::FromStr;

#[allow(unused_macros)]
macro_rules! debug {($($a:expr),*) => {println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);}}
#[allow(unused_macros)]
macro_rules! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut iter = $ s . split_whitespace ( ) ; let mut next = || { iter . next ( ) . unwrap ( ) } ; input_inner ! { next , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let mut bytes = std :: io :: Read :: bytes ( std :: io :: BufReader :: new ( stdin . lock ( ) ) ) ; let mut next = move || -> String { bytes . by_ref ( ) . map ( | r | r . unwrap ( ) as char ) . skip_while ( | c | c . is_whitespace ( ) ) . take_while ( | c |! c . is_whitespace ( ) ) . collect ( ) } ; input_inner ! { next , $ ( $ r ) * } } ; }
#[allow(unused_macros)]
macro_rules! input_inner { ( $ next : expr ) => { } ; ( $ next : expr , ) => { } ; ( $ next : expr , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ next , $ t ) ; input_inner ! { $ next $ ( $ r ) * } } ; }
#[allow(unused_macros)]
macro_rules! read_value { ( $ next : expr , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ next , $ t ) ) ,* ) } ; ( $ next : expr , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ next , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ next : expr , chars ) => { read_value ! ( $ next , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ next : expr , usize1 ) => { read_value ! ( $ next , usize ) - 1 } ; ( $ next : expr , $ t : ty ) => { $ next ( ) . parse ::<$ t > ( ) . expect ( "Parse error" ) } ; }

#[derive(PartialEq, PartialOrd)]
pub struct Total<T>(pub T);
impl<T: PartialEq> Eq for Total<T> {}
impl<T: PartialOrd> Ord for Total<T> { fn cmp(&self, other: &Total<T>) -> std::cmp::Ordering { self.0.partial_cmp(&other.0).unwrap() }}

#[allow(dead_code)]
const MAX:usize = 100006;
#[allow(dead_code)]
const MOD:i64 = 1e9 as i64 + 7;


#[allow(dead_code)]
fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().split_whitespace()
        .map(|e| e.parse().ok().unwrap()).collect()
}


#[allow(unused_imports)]
use std::f64;

#[allow(dead_code)]
fn min<T: PartialOrd>(a:T, b:T) -> T {
    if a < b { a }
    else { b }
}
#[allow(dead_code)]
fn max<T: PartialOrd>(a:T, b:T) -> T {
    if a < b { b }
    else { a }
}

use std::hash::Hash;
#[allow(dead_code)]
fn inc<T: Hash+Ord>(map:&mut BTreeMap<T,i64>, key:T) {
    let count = map.entry(key).or_insert(0);
    *count += 1;
}

pub struct UnionFind {
    p: Vec<usize>,
    sizes: Vec<usize>,
}

impl UnionFind {
    fn new(size: usize) -> UnionFind {
        let mut tree = UnionFind { p: vec![0;size], sizes: vec![1;size] };
        for i in 0..size { tree.make_set(i); }
        tree
    }

    fn make_set(&mut self, x: usize) {
        self.p[x] = x;
    }

    fn same(&mut self, x: usize, y: usize) -> bool {
        self.find_set(x) == self.find_set(y)
    }

    fn size(&mut self, x: usize) -> usize {
        let root_x = self.find_set(x);
        self.sizes[root_x]
    }

    fn unite(&mut self, x: usize, y: usize) {
        let x = self.find_set(x);
        let y = self.find_set(y);
        if x == y { return; }
        if self.sizes[x] < self.sizes[y] { self.sizes.swap(x,y); }
        self.sizes[x] += self.sizes[y];
        self.p[y] = x;
    }

    fn find_set(&mut self, x: usize) -> usize {
        if x != self.p[x] {
            let q = self.p[x];
            self.p[x] = self.find_set(q);
        }
        self.p[x]
    }
}


fn main() {
    input!{n:usize, m:usize, k:usize, p:[(usize1,usize1);m], q:[(usize1,usize1);k]};

    let mut uf = UnionFind::new(n);

    let mut friend_map = BTreeMap::new();
    for i in 0..m {
        let (a,b) = p[i];
        uf.unite(a,b);
        inc(&mut friend_map, a);
        inc(&mut friend_map, b);
    }

    let mut block_map = BTreeMap::new();
    for i in 0..k {
        let (c,d) = q[i];
        if uf.same(c,d) {
            inc(&mut block_map, c);
            inc(&mut block_map, d);
        }
    }
    //debug!(block_map);

    for i in 0..n {
        let fc = *friend_map.get(&i).unwrap_or(&0) as usize;
        let bc = *block_map.get(&i).unwrap_or(&0) as usize;
        print!("{} ", uf.size(i) - 1 - fc - bc);
    }
    println!();

}

Measured memory_bytes: 16380