#include <fstream>
#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define EPS 1e-8
#define LL_INF 0x3fffffffffffffff
#define INF 0x3f3f3f3f3f3f3f3f
#define MEM(a, b) memset(a, b, sizeof(a))
#define PPER(i, n, m) for (int i = n; i >= m; i--)
#define REPP(i, n, m) for (int i = n; i <= m; i++)
#define REP(i, n, m) for (int i = n; i < m; i++)
#define PER(i, n, m) for (int i = n; i > m; i--)
#define SA(n) scanf("%d", &(n))
#define SLLA(n) scanf("%lld", &(n))
#define MP make_pair
#define FF first
#define SS second
#define PB push_back
#define DE(val) cout << #val << ": " << val << endl;

const int dx44[6] = {0, -1, -1, 1, 1};
const int dy44[6] = {0, -1, 1, -1, 1};
const int dx4[6] = {0, 1, 0,-1};
const int dy4[6] = {-1, 0, 1,0};
const int dx8[9] = {0, -1, 0, 1, 0, 1, 1, -1, -1};
const int dy8[9] = {0, 0, 1, 0, -1, 1, -1, 1, -1};
const int dx82[9] = {0, -1, -1, 1, 1, 2, 2, -2, -2};
const int dy82[9] = {0, 2, -2, 2, -2, 1, -1, 1, -1};
void update(ll& x,ll v){
    if(x==-1)x=v;
    else if(x>v)x=v;
}

ll po(ll a, ll b, ll mod)
{
    ll res = 1;
    a %= mod;
    for (; b; b >>= 1)
    {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
    }
    return res;
}
ll gcd(ll a, ll b)
{
    if (a == 0)
    {
        return b;
    }
    else
    {
        return gcd(b % a, a);
    }
}
void extgcd(ll a, ll b, ll &d, ll &x, ll &y)
{
    if (!b)
    {
        d = a;
        x = 1;
    }
    else
    {
        extgcd(b, a % b, d, y, x);
        y -= x * (a / b);
    }
}
ll inverse(ll a, ll n)
{
    ll d, x, y;
    extgcd(a, n, d, x, y);
    return d == 1 ? (x + n) % n : -1;
}
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const int maxn = 2e3 + 5;
const double PI = acos(-1.0);
const ll mod = 998244353;
/*************************************************************************/

int n, x, y;
int val[maxn][maxn];
std::vector<int> edge[maxn];
map<int,int>hax;


int cald(int d1,int d2) {
    int cir = y - x + 1;
    return min(d2 - d1, cir - (d2-d1)); 
}

bool incircle(int d1) {
    return d1 >= x && d1 <= y;
}

void solve() {   
    SA(n);
    SA(x);
    SA(y);
    int dx = min(x, y);
    int dy = max(x, y);
    // DE(cald(2,4))
    REPP(i,1,n) {
        // DE(i)
        // DE(incircle(i))
        REPP(j,i+1, n) {
            int dis = j-i;
            int cir = dy - dx;
                       
            if((!incircle(i)) && (!incircle(j))) {
                if(i < x && j > y)
                    dis = min(dis, j - i - (cir-1));
            } else if(!incircle(i) && incircle(j)) {
                int d = dx - i;
                dis = min(dis, d + cald(dx, j));
            } else if(incircle(i) && !incircle(j)) {
                int d = abs(j-dy);
                dis = min(dis, d + cald(i, dy));
            } else {
                dis = min(dis, cald(i,j));
            }
            // cout<<i <<" "<<j<<" "<<dis<<endl;
            hax[dis]++;
        }
    }
    REPP(i,1,n-1) {
        printf("%d\n", hax[i]);
    }
}

int main()
{
#ifndef ONLINE_JUDGE
  //freopen("/Users/chong_wang/Desktop/ev/Code/i.txt", "r", stdin);
  //freopen("o.txt", "w", stdout);
#endif
     solve();
  return 0;
}





Measured memory_bytes: 384