#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using uInt = long long unsigned int;
using Double = long double;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//edit
class Dijkstra {
public:
    using T = long long int;
    typedef pair<T, int> P; //firstは最短距離、secondは頂点の番号
    const T inf = (T) 5e15;
    vector<Int> cnt;

    struct edge {
        int to;
        T cost;
    };

    int V;                  //超点数
    vector<vector<edge>> G; //グラフ,G[i]はiから出る辺の集合,G[i][j]はiから出る辺のj番目の辺
    vector<T> d;           //最短距離

    //0origin
    Dijkstra(int N) {
        V = N;
        G = vector<vector<edge >>(N);
        d = vector<T>(N);
        cnt.resize(N, 0);
    };

    void dijkstra(int s) {
        priority_queue<P, vector<P>, greater<P>> que;
        fill(d.begin(), d.end(), inf);
        fill(all(cnt), 0);

        d[s] = 0;
        cnt[s] = 1;
        que.push(P(0, s));

        while (!que.empty()) {
            P p = que.top();
            que.pop();
            int v = p.second;
            if (d[v] < p.first)
                continue;
            for (int i = 0; i < G[v].size(); i++) {
                edge e = G[v][i];
                if (d[e.to] > d[v] + e.cost && !(d[e.to] == inf && d[v] == inf)) {
                    d[e.to] = d[v] + e.cost;
                    que.push(P(d[e.to], e.to));
                    cnt[e.to] = cnt[v];
                } else if (d[e.to] == d[v] + e.cost && !(d[e.to] == inf && d[v] == inf)) {
                    cnt[e.to] += cnt[v];
                }
            }
        }
    }

    /* 頂点fromに頂点toに達するコストcostの辺を貼る */
    void addEdge(int from, int to, T cost) {
        edge e;
        e.to = to;
        e.cost = cost;
        G[from].push_back(e);
    }

    T getDist(int v) {
        return d[v];
    }
};

class Solve {
public:
//    void solve() {
////        Int X;
////        cin >> X;
////        Int tapu = X / 500;
////        Int neri = tapu * 1000;
////        X %= 500;
////        Int tapi = X / 5;
////        neri += tapi * 5;
////        cout << neri << endl;
//
//        Int K, N;
//        cin >> K >> N;
//        vector<Int> A(N);
//        rep(i, 0, N) cin >> A[i];
//        Int ans = INFl;
//        for (int i = 0; i < N; ++i) {
//            Int tmp = K - ((-A[i] + A[(i + 1) % N]) % K + K) % K;
//            chmin(ans, tmp);
//        }
//        cout << ans << endl;
//
//    }

    void solve() {
        Int N, X, Y;
        cin >> N >> X >> Y;
        Dijkstra dij(N + 1);
        for (int i = 1; i < N; ++i) {
            dij.addEdge(i, i + 1, 1);
            dij.addEdge(i + 1, i, 1);
        }
        dij.addEdge(X, Y, 1);
        dij.addEdge(Y, X, 1);

        vector<Int> ans(N + 1);
        for (int i = 1; i <= N; ++i) {
            dij.dijkstra(i);
            for (int j = i + 1; j <= N; ++j) {
                Int dist = dij.getDist(j);
//                ans[dist] += dij.cnt[j];
                ans[dist]++;
            }
        }
        for (int i = 1; i < N; ++i) {
            cout << ans[i] << endl;
        }

//        Int l = accumulate(all(ans), 0ll), r = N * (N - 1) / 2;
//        assert(l == r);
    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 512