#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let (n,x,y) = get!(usize, usize, usize);
    let mut nodes = vec![Vec::new(); n+1];
    for i in 1..n {
        nodes[i].push(i+1);
        nodes[i+1].push(i);
    }

    nodes[x].push(y);
    nodes[y].push(x);

    let mut maps = Vec::new();
    for i in 1..n+1 {
        let mut queue = VecDeque::new();
        let mut dist = vec![None; n+1];
        queue.push_back((i,0));
        dist[i] = Some(0);
        while let Some((node, d)) = queue.pop_front() {
            for &next in &nodes[node] {
                if dist[next].is_some() {
                    continue;
                }
                dist[next] = Some(d+1);
                queue.push_back((next, d+1));
            }
        }
        let mut map = BTreeMap::new();
        for i in 1..n+1 {
            *map.entry(dist[i].unwrap()).or_insert(0) += 1;
        }
        maps.push(map);
    }

    for k in 1..n {
        let mut sum = 0usize;
        for i in 1..n+1 {
            if let Some(val) = maps[i-1].get(&k) {
                sum += *val;
            }
        }
        println!("{}", sum/2);
    }
}


Measured memory_bytes: 149884