// Slower C++ solution:
// Template //

#include<bits/stdc++.h>

using namespace std;



// マクロ //

#define rep(i,N) for(int i = 0; i < N; i++)

#define all(x) x.begin(), x.end()

#define sort(x) sort(all(x))

#define uniq(x) x.erase(unique(all(x)), x.end())

#define vsum(x) accumulate(all(x), 0)

#define cou(x) cout << x << endl

#define y() cout << "Yes" << endl

#define n() cout << "No" << endl

#define Y() cout << "YES" << endl

#define N() cout << "NO" << endl

#define x2(x) (x) * (x)



// 型エイリアス //

using lint = long long;

using pii = pair<int, int>;

using vi = vector<int>;

using vli = vector<lint>;

using vc = vector<char>;

using vs = vector<string>;

using vb = vector<bool>;

using vvi = vector<vi>;

using vvb = vector<vb>;

using vvc = vector<vc>;

using vpii = vector<pii>;

using msi = map<string, int>;



// 関数 //

template<class T> lint gcd(T a, T b) {

    int t;

    while (b != 0) {

        t = a % b;

        a = b;

        b = t;

    }

    return a;

}



template<class T> lint lcm(T a, T b) {

    return a * b / gcd(a, b);

}



double distance(pii a, pii b) {

    double dist;

    dist = sqrt(x2(a.first - b.first) + x2(a.second - b.second));

    return dist;

}



lint perm(int a) {

    lint perm = 1;

    for (int i = a; i >= 1; i--) {

        perm *= i;

    }

    return perm;

}



lint combination(int n, int m) {

    long double c = 1;

    for (int i = n, k = 1; i > m; i--, k++) {

        c *= i;

        c /= k;

    }

    return (lint)c;

}



template<class T, class Q> inline bool chmin(T& a, Q b) {

    if (a > b) { 

        a = b;

        return true; 

    }

    return false;

}



template<class T, class Q> inline bool chmax(T& a, Q b) {

    if (a < b) { 

        a = b; 

        return true; 

    }

    return false;

}



// 定数 //

#define pi acos(-1)

#define mod 1000000007

#define MOD 998244353

#define inf ((1LL << 62) - 1 + (1LL << 62))



// キーワード //

#define elif else if



// End of Template //







int main() {



    cin.tie(0);

    ios::sync_with_stdio(false);

        

    int N, X, Y;

    cin >> N >> X >> Y;

    vvi graph(N);

    graph[X - 1].push_back(Y - 1);

    graph[Y - 1].push_back(X - 1);

    

    rep(i, N - 1) {

        graph[i].push_back(i + 1);

        graph[i + 1].push_back(i);

    }

    queue<int> seen;



    vi dist(N, -1);

    vi cnt(N, 0);

    

    rep(i, N) {

        seen.push(i);

        dist[i] = 0;

        while (seen.size()) {

            int v = seen.front(); seen.pop();

            for (auto x : graph[v]) {

                if (dist[x] != -1) continue;

                seen.push(x); dist[x] = dist[v] + 1;

                cnt[dist[x] - 1]++;

            }

        }

        dist.assign(N, -1);

    }

    rep(i, N - 1) {

        cou(cnt[i] / 2);

    }



}

// Faster C++ solution for the same problem (measured speedup: 1.115166967902333x):
#include <cstdio>

#include <vector>

#include <algorithm>



int main() {

    int N, X, Y;

    scanf("%d %d %d", &N, &X, &Y);

    std::vector <int> count;

    for (int i = 0; i < N; i++) {

        count.push_back(0);

    }

    for (int i = 1; i < N; i++) {

        for (int j = i + 1; j < N + 1; j++) {

            count[std::min({abs(i - j),

                            abs(X - i) + 1 + abs(j - Y),

                            abs(Y - i) + 1 + abs(j - X)})] += 1;

        }

    }

    for (int i = 1; i < N; i++) {

        printf("%d\n", count[i]);

    }

}