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

// #include <boost/algorithm/string/join.hpp>
// using boost::algorithm::join;
//
#include "boost/multi_array.hpp"
// boost::multi_array<int, 3> dp;
// dp.resize(boost::extents[10][9][8]);
//
// #include <boost/multiprecision/cpp_dec_float.hpp>  // quite slowly
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision; // mp::log10
// using bigint = boost::multiprecision::cpp_int;
// using rational = mp::cpp_rational;  // double d = static_cast<double>(r);

typedef long long ll;
typedef unsigned long long ull;
//typedef long double ld;

typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double,double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int > > vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;

//constexpr ll MOD = 1e9+7;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/4;
constexpr int INF=inf<int>;
constexpr ll LINF=inf<ll>;

#define Sort(x) sort(begin(x),end(x))
#define Reverse(x) reverse(begin(x),end(x))
#define ABS(a,b) ((a)<(b)?(b)-(a):(a)-(b))
#define nbit(n) (1ull<<(n))
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...) _ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n) for(int i=n-1;i>=0;--i)
#define REPA(i,v) REP(i,(v).size())

// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置

// Returns minimum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmin(T& a, T b) {
  if (a > b) {
    a = b;
  }
  return a;
}

// Returns maximum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmax(T& a, T b) {
  if (a < b) {
    a = b;
  }
  return a;
}

template <typename T>
void dumpContents(const T& v, const string& msg)
{
  cerr << "### " << msg << " ###\n";
  for (const auto& x : v) {
    cerr << x << " ";
  }
  cerr << endl;
}

struct before_main_function {
  before_main_function() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<setprecision(20)<<fixed;
#define endl "\n"
  }
} before_main_function;

// ========== end of template ==========
int N, X, Y;
vvi G;

void bfs(int s, vi& d) {
  deque<int> q;

  q.emplace_back(s);
  d[s] = 0;

  while (!q.empty()) {
    int u = q.front(); q.pop_front();

    for (int v : G[u]) {
      //if (d[v] >= 0 && d[v] <= d[u]+1) continue;
      if (d[v] >= 0) continue;

      d[v] = d[u] + 1;
      q.emplace_back(v);
    }
  }
}

int main(int argc, char** argv) {
  cin >> N >> X >> Y;
  X--; Y--;

  G.resize(N);
  REP(i, N-1) {
    G[i].emplace_back(i+1);
    G[i+1].emplace_back(i);
  }
  G[X].emplace_back(Y);
  G[Y].emplace_back(X);

  vi ret(N);

  vi d(N, -1);
  bfs(0, d);

  // inside A: 0..X
  {
    int n = X+1;
    REP(i, 1, n) {
      ret[i] += n-i;
    }
  }
  // inside B: Y..N-1
  {
    int n = N-Y;
    REP(i, 1, n) {
      ret[i] += n-i;
    }
  }
  // inside C: X..Y
  {
    REP(i, X+1, Y-1) {
      REP(j, i+1, Y) {
        int tmp1 = j-i;
        int tmp2 = i-X + Y-j +1;
        int l = min({tmp1, tmp2});
        ret[l]++;
      }
    }
  }

  {
    // A -> (B+C)
    REP(i, X+1) {
      REP(j, X+1, N) {
        int l = d[j]-d[i];
        assert(l>=0);
        ret[l]++;
      }
    }
  }

  {
    vi dd(N, -1);
    bfs(N-1, dd);
    REP(i, Y, N) {
      REP(j, X+1, Y) {
        int l = dd[j]-dd[i];
        assert(l>=0);
        ret[l]++;
      }
    }
  }

  REP(k, 1, N) {
    cout << ret[k] << endl;
  }

  return 0;
}

/* vim: set expandtab shiftwidth=2 softtabstop=2 : */


Measured memory_bytes: 384