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

void main() {
    auto s = readln.split.map!(to!int);
    auto N = s[0];
    auto X = s[1] - 1;
    auto Y = s[2] - 1;

    auto D = new int[][](N, N);
    foreach (i; 0..N) foreach (j; 0..N) D[i][j] = abs(i - j);
    D[X][Y] = D[Y][X] = 1;

    foreach (i; 0..N) foreach (j; 0..N) D[i][j] = min(D[i][j], abs(i - X) + 1 + abs(j - Y));
    foreach (i; 0..N) foreach (j; 0..N) D[i][j] = min(D[i][j], abs(i - Y) + 1 + abs(j - X));

    auto ans = new int[](N+1);
    foreach (i; 0..N) foreach (j; i+1..N) ans[D[i][j]] += 1;

    ans[1..N].each!writeln;
}