import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
    std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
    std.random, std.typecons, std.container;

ulong MAX = 1_000_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
alias Clue = Tuple!(long, "x", long, "y", long, "h");
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);

long cnt;

void main()
{
    long n, x, y;
    scan(n, x, y);
    x--, y--;
    if (x > y)
        swap(x, y);
    auto dist = new long[](n - 1);
    foreach (i; iota(n))
    {
        foreach (j; iota(i + 1, n))
        {
            dist[min(j - i, abs(x - i) + abs(y - j) + 1) - 1]++;
        }
    }
    foreach (e; dist)
        e.writeln();
}

bool is_mindist(long i, long j, long x, long y, long dist)
{
    return dist == min(j - i, abs(x - i) + abs(y - j) + 1);
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
