macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut iter = $ s . split_whitespace ( ) ; input_inner ! { iter , $ ( $ r ) * } } ; ( iter = $ iter : ident , $ ( $ r : tt ) * ) => { let s = { use std :: io :: Read ; let mut s = String :: new ( ) ; std :: io :: stdin ( ) . read_to_string ( & mut s ) . unwrap ( ) ; s } ; let mut $ iter = s . split_whitespace ( ) ; input_inner ! { $ iter , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { let s = { use std :: io :: Read ; let mut s = String :: new ( ) ; std :: io :: stdin ( ) . read_to_string ( & mut s ) . unwrap ( ) ; s } ; let mut iter = s . split_whitespace ( ) ; input_inner ! { iter , $ ( $ r ) * } } ; }
macro_rules ! input_inner { ( $ iter : expr ) => { } ; ( $ iter : expr , ) => { } ; ( $ iter : expr , mut $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let mut $ var = read_value ! ( $ iter , $ t ) ; input_inner ! { $ iter $ ( $ r ) * } } ; ( $ iter : expr , mut $ var : ident $ ( $ r : tt ) * ) => { input_inner ! { $ iter , mut $ var : usize $ ( $ r ) * } } ; ( $ iter : expr , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ iter , $ t ) ; input_inner ! { $ iter $ ( $ r ) * } } ; ( $ iter : expr , $ var : ident $ ( $ r : tt ) * ) => { input_inner ! { $ iter , $ var : usize $ ( $ r ) * } } ; }
macro_rules ! read_value { ( $ iter : expr , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ iter , $ t ) ) ,* ) } ; ( $ iter : expr , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ iter , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ iter : expr , { chars : $ base : expr } ) => { read_value ! ( $ iter , String ) . chars ( ) . map ( | c | ( c as u8 - $ base as u8 ) as usize ) . collect ::< Vec < usize >> ( ) } ; ( $ iter : expr , { char : $ base : expr } ) => { read_value ! ( $ iter , { chars : $ base } ) [ 0 ] } ; ( $ iter : expr , chars ) => { read_value ! ( $ iter , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ iter : expr , char ) => { read_value ! ( $ iter , chars ) [ 0 ] } ; ( $ iter : expr , usize1 ) => { read_value ! ( $ iter , usize ) - 1 } ; ( $ iter : expr , $ t : ty ) => { $ iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) } ; }
pub mod at {
    pub struct UnionFind {
        parents: Vec<isize>,
    }
    use std::collections::HashMap;
    impl UnionFind {
        pub fn new(n: usize) -> UnionFind {
            let parents = vec![-1; n];
            UnionFind { parents: parents }
        }
        pub fn find(&mut self, x: usize) -> usize {
            if self.parents[x] < 0 {
                x
            } else {
                let xx = self.parents[x] as usize;
                let y = self.find(xx);
                self.parents[x] = y as isize;
                y
            }
        }
        pub fn unite(&mut self, x: usize, y: usize) -> bool {
            use std::mem::swap;
            let mut x = self.find(x);
            let mut y = self.find(y);
            if x == y {
                return false;
            }
            if self.parents[x] > self.parents[y] {
                swap(&mut x, &mut y);
            }
            self.parents[x] += self.parents[y];
            self.parents[y] = x as isize;
            true
        }
        pub fn size(&mut self, x: usize) -> usize {
            let x = self.find(x);
            (-self.parents[x]) as usize
        }
        pub fn same(&mut self, x: usize, y: usize) -> bool {
            self.find(x) == self.find(y)
        }
        pub fn members(&mut self, x: usize) -> Vec<usize> {
            let root = self.find(x);
            (0..self.parents.len())
                .into_iter()
                .filter(|i| self.find(*i) == root)
                .collect::<Vec<usize>>()
        }
        pub fn roots(&mut self) -> Vec<usize> {
            (0..self.parents.len())
                .into_iter()
                .filter(|i| self.parents[*i] < 0)
                .collect::<Vec<usize>>()
        }
        pub fn all_group_members(&mut self) -> HashMap<usize, Vec<usize>> {
            let mut groups_map = HashMap::new();
            for x in 0..self.parents.len() {
                let r = self.find(x);
                groups_map.entry(r).or_insert(vec![]).push(x);
            }
            groups_map
        }
    }
}
use at::*;
fn main() {
    input! { n, m, k, ab:[(usize1,usize1); m], cd:[(usize1,usize1); k] };
    let mut uf = UnionFind::new(n);
    let mut ans = vec![0; n];
    for &(a, b) in &ab {
        uf.unite(a, b);
    }
    for i in 0..n {
        ans[i] = uf.size(i) - 1;
    }
    for &(a, b) in &ab {
        ans[a] -= 1;
        ans[b] -= 1;
    }
    for &(c, d) in &cd {
        if uf.same(c, d) {
            ans[c] -= 1;
            ans[d] -= 1;
        }
    }
    for i in 0..n {
        print!("{} ", ans[i]);
    }
    println!("");
}


Measured memory_bytes: 14840