use std::collections::VecDeque;
use std::collections::HashSet;
fn solve() {
    let stdin = std::io::stdin();
    let mut scn = Scanner {
        stdin: stdin.lock(),
    };
    let n: usize = scn.read();
    let x: usize = scn.read::<usize>() - 1;
    let y: usize = scn.read::<usize>() - 1;
    let mut costs = vec![vec![1 << 30; n]; n];
    let mut que = VecDeque::new();
    for i in 0..n {
        //(pos, cost, src)
        que.push_back((i, 0, i));
    }
    for k in 1..n {
        let mut result = 0;
        let mut next_que = VecDeque::new();
        let mut results = HashSet::new();
        while let Some(p) = que.pop_front() {
            let (pos, cost, src) = p;
            //eprintln!("{:?} {}", p, costs[src][pos]);
            if costs[src][pos] < cost {
                continue;
            }
            costs[pos][src] = cost;
            costs[src][pos] = cost;
            if cost == k {
                results.insert((src, pos));
                //result += 1;
                next_que.push_back(p);
                continue;
            }
            if pos >= 1 {
                que.push_back((pos - 1, cost + 1, src));
            }
            if pos + 1 < n {
                que.push_back((pos + 1, cost + 1, src));
            }
            if pos == x {
                que.push_back((y, cost + 1, src));
            }
            if pos == y {
                que.push_back((x, cost + 1, src));
            }
        }
        que = next_que;
        //eprintln!("{:?}", que);
        println!("{}", results.len() / 2);
    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024) // 64MB
        .spawn(|| solve())
        .unwrap()
        .join()
        .unwrap();
}
pub mod utils {
    const DYX: [(isize, isize); 8] = [
        (0, 1),   //right
        (1, 0),   //down
        (0, -1),  //left
        (-1, 0),  //top
        (1, 1),   //down right
        (-1, 1),  //top right
        (1, -1),  //down left
        (-1, -1), //top left
    ];

    pub fn try_adj(y: usize, x: usize, dir: usize, h: usize, w: usize) -> Option<(usize, usize)> {
        let ny = y as isize + DYX[dir].0;
        let nx = x as isize + DYX[dir].1;
        if ny >= 0 && nx >= 0 {
            let ny = ny as usize;
            let nx = nx as usize;
            if ny < h && nx < w {
                Some((ny, nx))
            } else {
                None
            }
        } else {
            None
        }
    }
}

//snippet from kenkoooo
pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_line(&mut self) -> String {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b'\n' || b == b'\r')
            .take_while(|&b| b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 49532