import std.algorithm;
import std.stdio;
import std.math;

void main() {
	int n, x, y;
	readf(" %s %s %s", &n, &x, &y);
	--x;
	--y;

	foreach (k;1..n) {
		int count = 0;

		foreach (left;0..n) {
			foreach (right;left + 1..n) {
				auto d = min(abs(left - x) + abs(right - y) + 1, right - left);
				if (d == k) ++count;
			}
		}
		writeln(count);
	}
}
