import std.conv, std.stdio;
import std.algorithm, std.array, std.string, std.range;

void main()
{
    auto
        buf = readln.chomp.split.to!(int[]),
        n = buf[0], x = buf[1] - 1, y = buf[2] - 1,
        d = new int[][](n, n);
    foreach (i; 0..n)
        foreach (j; i..n)
            d[i][j] = j - i;
    int[int] c;
    foreach (i; 1..n)
        c[i] = n - i;
    c[d[x][y]] -= 1;
    d[x][y] = 1;
    c[1] += 1;
    foreach (i; 0..n)
        foreach (j; i..n)
        {
            c[d[i][j]] -= 1;
            d[i][j] = d[i][j].min(d[i.min(x)][i.max(x)] + 1 + d[j.min(y)][j.max(y)]);
            c[d[i][j]] += 1;
        }
    foreach (i; 1..n)
        c[i].writeln;
}
