#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(int i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

using pint = std::pair<int, int>;
using pll = std::pair<ll, ll>;


constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };

namespace {
	template<typename T> void chmax(T& a, T b) { a = std::max(a, b); }
	template<typename T> void chmin(T& a, T b) { a = std::min(a, b); }
	template<typename T> void chadd(T& a, T b) { a = a + b; }

	void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
	template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
	template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

	void CCout(long long x, const char* end = "\n") { std::cerr << x << end; }
	template <typename T> void CCout(const T& x, const char* end = "\n") { std::cerr << x << end; }
	template <typename T> void CCout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cerr << x[i] << (i == sz - 1 ? end : sep); } }

	// 標準入出力
	struct inp {
		std::size_t sz;
		inp(std::size_t _sz = 1) : sz(_sz) {}
		template <typename T> operator T () const { T a; std::cin >> a; return a; }
		template <typename T> operator std::vector<T>() const { vector<T> a(sz); for (std::size_t i = 0; i < sz; i++) std::cin >> a[i]; return a; }
		template <typename T, typename U> operator std::pair<T, U>() const { T f; U s; std::cin >> f >> s; return std::pair<T, U>(f, s); }
	};

	inp inp1; // input one

#define MAX_V 2010
	vector<pair<ll, ll>> G[MAX_V];
	// ダイクストラ法
	vector<ll> dijkstra(ll start) {
		vector<ll> dist(MAX_V, infll);
		dist[start] = 0; // dist[i] := start->iまでの最短距離
		priority_queue < pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> que;
		que.push({ 0, start });
		while (!que.empty()) {
			ll cost, u; // 今までにかかった時間　現在の頂点
			cost = que.top().first, u = que.top().second;
			que.pop();
			if (dist[u] < cost) continue;
			for (auto tmp : G[u]) {
				ll v = tmp.first, time = tmp.second; // 隣接する頂点、その頂点まで行く時間
				if (dist[v] > dist[u] + time) {
					dist[v] = dist[u] + time;
					que.push({ dist[v], v });
				}
			}
		}
		return dist;
	}
}

int main() {

	int n, x, y;
	cin >> n >> x >> y;
	x--, y--;
	rep(i, n - 1) {
		G[i].push_back({ i + 1, 1 });
		G[i + 1].push_back({ i , 1 });
	}
	G[x].push_back({ y, 1 });
	G[y].push_back({ x, 1 });

	vector<int> ans(n, 0);

	rep(i, n) {
		vector<ll> dist = dijkstra(i);
		rep(j, n) {
			if (dist[j] != 0) {
				++ans[dist[j]];
			}
		}
	}

	Rep(i, 1, n) {
		cout << ans[i] / 2 << endl;
	}
	return 0;
}


Measured memory_bytes: 384