#include<bits/stdc++.h>
 
using namespace std;

template <class T> ostream& operator << (ostream &os, const vector<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T> ostream& operator << (ostream &os, const set<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T, class S> ostream& operator << (ostream &os, const pair<T, S> &v) { os << v.first << ' ' << v.second; return os; }
template <class T, class S> ostream& operator << (ostream &os, const map<T, S> &v) { for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' '; return os; }
template <class T, class S> ostream& operator << (ostream &os, const unordered_map<T, S> &v) { for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' '; return os; }
 
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <class Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << " : " << arg1 << endl; }
    template <class Arg1, class... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args) {
        const char* sep = strchr(names + 1, ',');
        cerr.write(names, sep - names) << " : " << arg1 << "  ";
        __f(sep + 1, args...);
    }
#else
#define trace(...) 0
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif

#define fast_cin() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX 1000000
#define ll long long
#define db double
#define str string
#define pb push_back
#define For(i,s,e) for (ll i=(s); i<(e); i++)
#define Forrev(i,s,e) for (ll i=(s); i>=(e); i--)
#define all(v) v.begin(),v.end()

#define vll vector<ll>
#define vs vector<string>
#define mapll map<ll,ll>
#define pll pair<ll,ll>
#define initialise(a, x) memset(a, x, sizeof(a))
#define maxheap priority_queue<ll>
#define minheap priority_queue<ll,vector<ll> ,greater<ll>>

#define ff first
#define ss second
#define endl "\n"
#define mp make_pair
const ll mod=1e9 + 7;

ll takemod(ll a) {
    return ((a%mod)+mod)%mod;
}

ll gcd(ll a, ll b) { 
    if (b == 0) 
        return a; 
    return gcd(b, a % b);        
}

ll fast_exp(ll base, ll expo) {
    ll res=1;
    while(expo>0) {
        if(expo&1) res=(res*base)%mod;
        base=(base*base)%mod;
        expo>>=1;}
    return res;
}

ll modinv(ll a) {
    return takemod(fast_exp(takemod(a), mod-2));
}

const int N=2e3+3;
vll graph[N];
ll n,x,y;
ll dist[N][N], visited[N];

void dfs(ll src,ll index, ll di)
{
	if(src!=index)
		dist[min(src,index)][max(src,index)]=min(dist[min(src,index)][max(src,index)],di);
	visited[index]=1;

	for(ll a: graph[index])
	{
		if(a<src)
		{
			For(i,1,n)
				dist[src][i]=min(dist[src][a]+1,dist[src][i]);
		}
		else
		{
			dfs(src,a,di+1);

		}
	}

}
void solve()
{
	cin>>n>>x>>y;
	For(i,1,n)
	{
		graph[i].pb(i+1);
		graph[i+1].pb(i);
	}
	graph[x].pb(y);
	graph[y].pb(x);

	memset(dist,-1,sizeof(dist));

	dist[x][y]=1;
	dist[y][x]=1;
	dist[x][x]=0;
	dist[y][y]=0;

	Forrev(i,x-1,1)
		dist[x][i]=x-i;
	For(i,y+1,n+1)
		dist[y][i]=i-y;

	For(i,x+1,y)
	{
		if(i-x<=1+y-i)
			dist[x][i]=i-x;
		else
			dist[x][i]=y-i+1;
	}
	Forrev(i,y-1,x)
	{
		if(y-i<=1+i-x)
			dist[y][i]=y-i;
		else
			dist[y][i]=i-x+1;
	}
	For(i,y+1,n+1)
	{
		dist[x][i]=1+dist[y][i];
	}
	Forrev(i,x-1,1)
	{
		dist[y][i]=1+dist[x][i];
	}
	


	For(i,1,n+1)
	{
		if(i==x or i==y)
			continue;

		For(j,1,n+1)
		{
			ll val1=abs(i-j);
			ll val2=abs(i-x)+dist[x][j];
			ll val4=abs(i-y)+dist[y][j];
			dist[i][j]=min(val1,min(val2,val4));
		}
	}

	
	
	ll ans[n];
	memset(ans,0,sizeof(ans));

	For(i,1,n+1)
	{
		For(j,i+1,n+1)
		{
			ans[dist[i][j]]++;
		}
	}
	For(i,1,n)
		cout<<ans[i]<<endl;
	cout<<endl;
}

signed main() 
{
    fast_cin();
    // #ifndef ONLINE_JUDGE
    // freopen("C:/IO/in.txt", "r", stdin);
    // freopen("C:/IO/out.txt", "w", stdout);
    // #endif
    
    int t=1;
    //cin>>t;
    while(t--)
    {
    	solve();
    }
    
    
    return 0;    
}

Measured memory_bytes: 31744