/*------------------------------------------------------------------*/
/*------------------------- begin template -------------------------*/
/*------------------------------------------------------------------*/

// ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
// diff: using Parser
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut parser = Parser::from_str($s);
        input_inner!{parser, $($r)*}
    };
    (parser = $parser:ident, $($r:tt)*) => {
        input_inner!{$parser, $($r)*}
    };
    (new_stdin_parser = $parser:ident, $($r:tt)*) => {
        use std::io::Read;
        let mut xs: Vec<u8> = Vec::new();;
        let stdin = std::io::stdin();
        stdin.lock().read_to_end(&mut xs);
        let mut $parser = Parser::new(xs);
        input_inner!{$parser, $($r)*}
    };
    ($($r:tt)*) => {
        input!{new_stdin_parser = parser, $($r)*}
    };
}

macro_rules! input_inner {
    ($parser:ident) => {};
    ($parser:ident, ) => {};
    ($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($parser, $t);
        input_inner!{$parser $($r)*}
    };
}

macro_rules! read_value {
    ($parser:ident, ( $($t:tt),* )) => {
        ( $(read_value!($parser, $t)),* )
    };
    ($parser:ident, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
    };
    ($parser:ident, chars) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()
    };
    ($parser:ident, usize1) => {
        read_value!($parser, usize) - 1
    };
    ($parser:ident, i64_) => {
        $parser.fast_i64()
    };
    ($parser:ident, usize_) => {
        $parser.fast_i64() as usize
    };
    ($parser:ident, usize1_) => {
        ($parser.fast_i64() - 1) as usize
    };
    ($parser:ident, $t:ty) => {
        $parser.next::<$t>().expect("Parse error")
    };
}

use std::io;
use std::io::BufRead;
use std::str;

// ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
// ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
// diff: using std::io::BufRead::fill_buf()
pub struct Parser {
    buf: Vec<u8>,
    pos: usize,
}

impl Parser {
    pub fn from_str(s: &str) -> Parser {
        Parser {
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}

impl Parser {
    pub fn new(xs: Vec<u8>) -> Parser {
        Parser { buf: xs, pos: 0 }
    }
    pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
        while self.buf[self.pos] <= 0x20 {
            self.pos += 1;
        }
        let begin = self.pos;
        while self.buf[self.pos] > 0x20 {
            self.pos += 1;
        }
        let end = self.pos;
        return unsafe { str::from_utf8_unchecked(&self.buf[begin..end]) }.parse::<T>();
    }
    pub fn fast_i64(&mut self) -> i64 {
        while self.buf[self.pos] <= 0x20 {
            self.pos += 1;
        }
        let is_positive = match self.buf[self.pos] {
            b'+' => {
                self.pos += 1;
                true
            }
            b'-' => {
                self.pos += 1;
                false
            }
            _ => true,
        };
        let mut res = 0;
        while self.buf[self.pos] > 0x20 {
            res = res * 10 + (self.buf[self.pos] as i64 - '0' as i64);
            self.pos += 1;
        }
        if is_positive {
            res
        } else {
            -res
        }
    }
}

#[allow(unused_imports)]
use std::cmp::*;
struct UnionFindNode {
    parent: usize,
    num: usize,
}

impl UnionFindNode {
    fn new(parent: usize) -> UnionFindNode {
        UnionFindNode {
            parent: parent,
            num: 1,
        }
    }
}

pub struct UnionFind(Vec<UnionFindNode>);

impl UnionFind {
    pub fn new(n: usize) -> UnionFind {
        let mut xs = vec![];
        for i in 0..n {
            xs.push(UnionFindNode::new(i));
        }
        UnionFind(xs)
    }
    pub fn root(&mut self, i: usize) -> usize {
        let parent = self.0[i].parent;
        if parent == i {
            i
        } else {
            let res = self.root(parent);
            self.0[i].parent = res;
            res
        }
    }
    pub fn unite(&mut self, i: usize, k: usize) {
        let i = self.root(i);
        let k = self.root(k);
        if i == k {
            return;
        }
        let (i, k) = if self.0[i].num < self.0[k].num {
            (i, k)
        } else {
            (k, i)
        };
        self.0[i].parent = k;
        self.0[k].num += self.0[i].num;
    }
    pub fn is_same_set(&mut self, i: usize, k: usize) -> bool {
        self.root(i) == self.root(k)
    }
    pub fn num(&mut self, i: usize) -> usize {
        let i = self.root(i);
        self.0[i].num
    }
}

fn main() {
    input! {
        new_stdin_parser = parser,
    }
    let res = solve(&mut parser);
    print!("{}", res);
}

/*------------------------------------------------------------------*/
/*-------------------------- end template --------------------------*/
/*------------------------------------------------------------------*/

use std::fmt::Write;
fn solve(parser: &mut Parser) -> String {
    let mut buf = String::new();
    input! {
        parser = parser,
        n: usize,
        m: usize,
        es: [(usize1_,usize1_); m],
    }
    let mut res = vec![];
    let mut uf = UnionFind::new(n);
    let mut tmp = n * (n - 1) / 2;
    for &(s, t) in es.iter().rev() {
        res.push(tmp);
        if !uf.is_same_set(s, t) {
            // eprintln!("{} {}", uf.num(s), uf.num(t));
            tmp -= uf.num(s) * uf.num(t);
        }
        uf.unite(s, t);
    }
    for &r in res.iter().rev() {
        writeln!(buf, "{}", r);
    }
    buf
}


Measured memory_bytes: 14588