#include <bits/stdc++.h>
using namespace std;

#define debug(x) cout <<"DEBUG"<<" "<< #x << ":" << x << '\n'

// n回繰り返し
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)   // 0-indexed昇順
#define rep1(i,n) for(int i = 1; i <= ((int)(n)); i++) // 1-indexed昇順
#define rrep(i,n) for(int i = ((int)(n)-1); i >= 0; i--)  // 0-indexed降順
#define rrep1(i,n) for(int i = ((int)(n)); i >= 1; i--)   // 1-indexed降順
#define all(x) (x).begin(),(x).end()

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vii;  // 2次元配列
typedef vector<ll> vll;
typedef vector<double> vd;
typedef pair<int, int> PII;

template<typename T>
using vec = vector<T>;
template<class T>
using maxheap = std::priority_queue<T>;
template<class T>
using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;

template<class T,class U> inline bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U> inline bool chmin(T &a, const U &b){if(a>b){a=b;return 1;}return 0;}

const ld Pi = std::acos(-1.0L);
const ll infll = (1LL<<62)-1;
const int inf = (1<<30)-1;
const int mod = 1000000007;
// const int mod = 998244353;

/*GRAPH_TEMPLATE=============================================*/
template<typename T>
class Edge {
public:
    int src;  // source 状態記録「null = -1」
    int to;  // 辺の行き先
    T cost;  // 辺の重み
    Edge(int t, T w) : src(-1), to(t), cost(w) {}
    Edge(int t, T w, int src) : src(src), to(t), cost(w) {}
};
template<typename T>
using W_Graph = std::vector<std::vector<Edge<T>>>;   //重み付きグラフ
using Graph = std::vector<std::vector<int>>;         //通常グラフ
template<typename T>
using Matrix = std::vector<std::vector<T>>;          //隣接行列(使わなさそう...)


/*FUNCs=================================================*/

/*Dijkstra(Basic)========================================*/
template<class T>
std::vector<T> Dijkstra(W_Graph<T> &G, int s) {
    const auto infinity = std::numeric_limits<T>::max();
    std::vector<T> min_dist(G.size(), infinity);

    using P = std::pair<T, int>; //pair<DistFromStartingPoint, IndexOfVertex>
    std::priority_queue<P, std::vector<P>, std::greater<P>> que;
    min_dist[s] = 0;
    que.emplace(min_dist[s], s);  //StartingPoint

    while(!que.empty()) {
        T dist;
        int index;
        tie(dist, index) = que.top();
        que.pop();
        if(dist > min_dist[index]) continue;

        for(auto &edge : G[index]) {
            auto new_dist = dist + edge.cost;
            //compare the length of each route and change min_dist[edge.to]
            if(new_dist >= min_dist[edge.to]) continue;
            min_dist[edge.to] = new_dist;
            que.emplace(min_dist[edge.to], edge.to);
        }
    }
    return min_dist;
}

/*MAIN==================================================*/
signed main(){
    int START_TIME = clock();
    cin.tie(nullptr);
    ios::sync_with_stdio(false);   //cin cout 高速化
    // cout << fixed << setprecision(15);

    int n,x,y; cin >> n >> x >> y;
    W_Graph<int> g(n);
    --x, --y;
    map<int ,int> ans;
    vi dists;
    rep(i,n-1) {
        g[i].push_back(Edge<int>(i+1, 1));
        g[i+1].push_back(Edge<int>(i, 1));
    }
    g[x].push_back(Edge<int>(y,1));
    g[y].push_back(Edge<int>(x,1));

    for(int i = 0; i < n; ++i) {
        dists = Dijkstra(g, i);
        for(int j = i+1; j < n; ++j) {
            ++ans[dists[j]];
        }
    }

    rep1(i,n-1) {
        if(ans.find(i)==ans.end()) {
            cout << 0 << '\n';
        }
        else cout << ans[i] << '\n';
    }

    // printf("ExecutionTime: %d /ms\n",1000*(int)((clock()-START_TIME)/CLOCKS_PER_SEC));
}

Measured memory_bytes: 512