#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <queue>

using namespace std;

typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vii;
typedef pair<int,int> pii;

#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ff it->first
#define ss it->second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(auto i=0;i<n;++i)
#define LOOP_IT(it,s) for(auto it=(s).begin();it!=(s).end();++it)


#ifdef LOCAL
#define cerr cout
#else
#endif

#define TRACE

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif


void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif


const int N=2003;
int mx=-1;
//vector<tuple<int,int,int>> bf;
vector<pair<int,int>> dj[N];
vector<vector<int>> fw(N,vector<int>(N));
int ok[2003]={};


/*void add_edge_bf(int u,int v,int w)
{
    bf.pb({u,v,w});
    bf.pb({v,u,w});
}*/
void add_edge_dj(int u,int v,int w)
{
    dj[u].pb({v,w});
    dj[v].pb({u,w});
}
void add_edge_fw(int u,int v,int w)
{
    fw[u][v]=w;
    fw[v][u]=w;
    fw[u][u]=0;
    fw[v][v]=0;
}

/*void bellman_ford(int x)
{
    int dis[N];
    rep(i,N) dis[i]=1e9;
    dis[x]=0;

    for(int i=1;i<=mx;++i)
    {
        for(auto e:bf)
        {
            int a,b,w;
            tie(a,b,w)=e;
            dis[b]=min(dis[b],dis[a]+w);
        }
    }
    for(int i=1;i<=mx;++i)
    cout<<dis[i]<<" ";
}
*/
void dijkstra(int x)
{
    vii dis(N,1e9);
    dis[x]=0;

    vector<bool> vis(N,0);

    priority_queue<pii,vector<pii>,greater<pii>> q;
    q.push({0,x});

    while(!q.empty())
    {
        //pri_q(q);
        int a = q.top().second;
        q.pop();
        if(vis[a]) continue;
        vis[a]=1;
        for(auto e : dj[a])
        {
            int b=e.first,w=e.second;
            if(dis[b]>dis[a]+w)
            {
                dis[b]=dis[a]+w;
                q.push({dis[b],b});
            }
        }
    }

    for(int i=1;i<=mx;++i)
        ++ok[dis[i]];
        //cout<<dis[i]<<" ";
}

void upd_fw_mat()
{
    rep(i,N)
    {
        rep(j,N)
        fw[i][j]=1e9;
    }
}

void floyd_warshall()
{
    for(int i=1;i<=mx;++i)
    {
        for(int j=1;j<=mx;++j)
        {
            for(int k=1;k<=mx;++k)
            {
                if(j!=k&&fw[i][j]&&fw[i][k])
                {
                    fw[j][k]=min(fw[j][k],fw[i][j]+fw[i][k]);
                    fw[k][j]=fw[j][k];
                }
            }
        }
    }

    for(int i=1;i<=mx;++i)
    {
        for(int j=1;j<=mx;++j)
        {
            if(fw[i][j]==1e9)
                cout<<"inf"<<" ";
            else
                cout<<fw[i][j]<<" ";
        }
        cout<<"\n";
    }
}

int main(int argc,char* argv[])
{
    FASTIO


    /*int n;
    cin>>n;
    //upd_fw_mat();
    rep(i,n)
    {
        int x,y,w;cin>>x>>y>>w;
        mx=max({mx,x,y});
        add_edge_dj(x,y,w);
    }


    //floyd_warshall();
    //bellman_ford(5);
    dijkstra(5);*/


    int n,u,v;
    cin>>n>>u>>v;
    //upd_fw_mat();
    for(int i=1;i<=n-1;++i)
    {
        int x=i,y=i+1,w=1;
        mx=max({mx,x,y});
        add_edge_dj(x,y,w);
    }
    add_edge_dj(u,v,1);


    //floyd_warshall();
    //bellman_ford(5);
    for(int i=1;i<=n;++i)
        dijkstra(i);
    for(int i=1;i<n;++i)
        cout<<ok[i]/2<<"\n";

    return 0;
}
/*
6
1 5 1
1 4 9
1 2 5
4 5 2
2 3 2
4 3 7
*/


Measured memory_bytes: 16128