#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;


const long long int mod = 998244353;
const long long int INF = 1e18;

long long int N,X,Y,res=INF,A[2005],fin[2005]={};
string t;

bool used[2005]={};
queue<long long int>que;
vector<long long int> Edge[20005];


int main()
{
    cout << fixed << setprecision(18);
    cin>>N>>X>>Y;
    for(long long int i = 2; i <= N-1; i++){
        Edge[i].push_back(i+1);
        Edge[i].push_back(i-1);
    }
    Edge[1].push_back(2);
    Edge[N].push_back(N-1);
    Edge[X].push_back(Y);
    Edge[Y].push_back(X);
    for(long long int i = 1; i <= N; i++){

        for(long long int j = 1; j <= N; j++){
            used[j]=false;
            A[j]=INF;
        }
        que.push(i);
        A[i]=0;
        while (!que.empty())
        {
            if(used[que.front()]){que.pop();continue;}
            used[que.front()]=true;
            for(long long int j = 0;  j< Edge[que.front()].size(); j++){
                if(A[Edge[que.front()][j]]==INF){A[Edge[que.front()][j]]=A[que.front()]+1;}
                que.push(Edge[que.front()][j]);
            }
            que.pop();
        }
        
        for(long long int j = 1; j <= N; j++){
            fin[A[j]]++;;
        }
        
        
    }
    for(long long int i = 1; i < N; i++){
        cout<<fin[i]/2<<endl;
    }
}


Measured memory_bytes: 768