#include <iostream>
#include <queue>
#include <map>
#include <bitset>
#include <string>
#include <set>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <ctime>
//#include <unordered_map>
#include <stack>
#include <cstdlib>
#include <numeric>
#include <cassert>
#include <complex>
using namespace std;
#define maxn 5007
#define maxm 10007
#define maxq 1000007
#define maxl 1234
#define modn 998244353
#define scan(a) scanf("%d",&a)
#define scanl(a) scanf("%lld",&a)
#define scanl2(a,b) scanf("%lld%lld",&a,&b)
#define scans(a) scanf("%s",a)
#define scans2(a,b) scanf("%s%s",a,b)
#define scand(a) scanf("%lf",&a)
#define scan2(a,b) scanf("%d%d",&a,&b)
#define scand2(a,b) scanf("%lf%lf",&a,&b)
#define scan3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scan4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define scan5(a,b,c,d,e) scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)
#define print(a) printf("%d\n",a);
#define printl(a) printf("%lld\n",a);
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define rrep(i,a,b) for(int i=a;i>= b;i--)
#define fscan(a) fscanf(stream,"%d", &a);
#define mp      make_pair	
#define pb      push_back
#define eb      emplace_back
#define mm(a,b) memset(a,b,sizeof a)
#define log2(n) (double)(log(n) / log(2.0))
#define _crt_disable_perfcrit_locks
#define bll __int128
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef map <ll, ll> mll;
typedef pair <ll, ll> pll;
typedef map <int, int> mii;
typedef pair <int, int> pii;
typedef map <char, int> mci;
typedef map <char, char> mcc;
typedef pair <char, int> pci;
typedef complex<double> cd;
typedef vector<complex<double> > vcd;

const double eps = 1e-8;
const double PI = 2 * acos(0.0);

int cc, bb; char ch; inline int F() {
	while (ch = getchar(), (ch < 48 || ch> 57) && ch != '-'); ch == '-' ? cc = bb = 0 : (cc = ch - '0', bb = 1);
	while (ch = getchar(), ch > 47 && ch < 58)cc = (cc << 1) + (cc << 3) + (ch ^ 48); return bb ? cc : -cc;
}
void write(int x) {
	int y = 10, len = 1;
	while (y <= x) { y *= 10; len++; }
	while (len--) { y /= 10; putchar(x / y + 48); x %= y; }
}
int n, m;
int d[maxn];
struct edge {
	int u, v, w, next;
	edge() { }
	edge(int u, int v, int w, int next) :u(u), v(v), w(w), next(next) { }
};
struct Node {
	int d, v;
	Node(int d = 0, int v = 0) :d(d), v(v) {}
	bool operator < (const Node& n)  const {
		return d > n.d;
	}
};
priority_queue<Node> q;//小根堆
class Dijkstra {
public:
	int m;
	bool vis[maxn];
	edge g[maxm];
	int st[maxn];
	void init() {
		m = 0;
		memset(vis, 0, sizeof vis);
		memset(st, -1, sizeof st);
	}
	void addedge(int u, int v, int w) {
		g[m] = edge(u, v, w, st[u]);
		st[u] = m++;
	}
	void go(int s) {
		d[s] = 0;
		q.push(Node(0, s));
		edge e;
		Node x;
		while (!q.empty()) {
			x = q.top();
			q.pop();
			int u = x.v;
			if (vis[u])continue;
			vis[u] = 1;
			for (int i = st[u]; i != -1; i = g[i].next) {
				e = g[i];
				if (d[e.v] > d[e.u] + e.w) {
					d[e.v] = d[e.u] + e.w;
					q.push(Node(d[e.v], e.v));
				}
			}
		}
	}
}dij;
int res[2007];
int main() {
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	//FILE* stream = fopen("L:/20.in", "rb+")
	int x, y;
	cin >> n >> x >> y;
	dij.init();
	for (int i = 1; i < n; i++)
		dij.addedge(i, i + 1, 1), dij.addedge(i + 1, i, 1);
	dij.addedge(x, y, 1), dij.addedge(y, x, 1);
	for (int i = 1; i < n; i++) {
		memset(dij.vis, 0, sizeof dij.vis);
		memset(d, inf, sizeof d);
		dij.go(i);
		for (int j = i + 1; j <= n; j++) {
			res[d[j]]++;
		}
	}
	for (int i = 1; i < n ; i++){
		cout << res[i] << endl;
	}
	return 0;
}

Measured memory_bytes: 384