#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;

static const int INTINF = (2147483647 >> 1); // 10^9 + 5000
static const ll LLINF = (9223372036854775807 >> 1);
static const int MAX = 1e5+1;
static const ll MOD = 1e9+7;

namespace Kunitaka{
    template<
        typename TYPE,
        std::size_t SIZE
    >
    std::size_t array_length(const TYPE (&array)[SIZE])
    {
        return SIZE;
    }

    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
}
using namespace Kunitaka;
namespace Printer{
    void br(){
        cout << endl;
    }

    void loop_cnt(int i){
        cout << "i = " << i << endl;
    }

    void loop_cnt(int i, int j){
        cout << "i = " << i << ", " << "j = " << j << endl;
    }

    template<class T>
    void print(T x){
        cout << x << endl;
    }

    template<class T, class S>
    void print(T x, S y){
        cout << x << "," << y << endl;
    }

    template<class T, class S, class U>
    void print(T x, S y, U z){
        cout << x << "," << y << "," << z << endl;
    }

    template<class T, class S>
    void print(pair<T, S> p){
        cout << p.first << ", " << p.second << endl;
    }

    template<
        typename TYPE,
        std::size_t SIZE
    >
    void print(const TYPE (&array)[SIZE]){
        int lim = array_length(array);
        for(int i=0; i<lim; i++){
            if(i) cout << " ";
            cout << array[i];
        }
        cout << endl;
    }

    template<class S>
    void print(vector<S> v){
        for(int i=0; i<v.size(); i++){
            if(i) cout << " ";
            cout<< v[i];
        }
        cout << endl;
    }

    template<class S>
    void print(vector<vector<S> > vv){
        for(int i=0; i<vv.size(); i++){
            for(int j=0; j<vv[i].size(); j++){
                if(j) cout << " ";
                cout << vv[i][j];
            }
            cout << endl;
        }
    }

    void yesno(bool x){
        if(x) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
};
using namespace Printer;

ll dp[3010][3010];

void bfs(int N, vector<vector<int> > g, int start){
    queue<int> q;
    q.push(start);
    vector<ll> dist(N, -1);
    dist[start] = 0;
    
    ll cnt = 1; // loopが何回めか
    while(!q.empty()){
        int v = q.front(); q.pop();
        for(int u : g[v]){
            if(dist[u] != -1) continue;
            dist[u] = dist[v] + 1;
            //  --- 処理 ---
            int a = min(u, start);
            int b = max(u, start);
            dp[a][b] = min(dp[a][b], dist[u]);
            //  -----------
            q.push(u);
        }
    }
}

int main(int argc, const char * argv[]) {
    //提出時、消す----//
  
    //--------------//


    // input
    cout << fixed << setprecision(10);

    int N, X, Y;
    vector<vector<int> > g(MAX);
    cin >> N >> X >> Y;
    X--;
    Y--;
    rep(i, N-1){
        g[i].push_back(i+1);
        g[i+1].push_back(i);
    }
    g[X].push_back(Y);
    g[Y].push_back(X);

    

    rep(i, 3010){
        rep(j, 3010){
            dp[i][j] = LLINF;
        }
    }

    rep(i, N){
        bfs(N, g, i);
    }


    vector<int> ans(N+1);

    rep(i, 3010){
        rep(j, 3010){
            if(dp[i][j] != LLINF){
                ans[dp[i][j]]++;
            }
        }
    }

    // print(dp[0][4]);

    rep2(i, 1, N){
        print(ans[i]);
    }


    
    
    return 0;
}


Measured memory_bytes: 75904