/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author Rishabhdeep Singh
 */

// doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;

// @formatter:off
#define F               first
#define S               second
#define all(x)          (x).begin(), (x).end()
#define sz(x)           (long long) (x).size()
#define IOS             ios::sync_with_stdio(false);cin.tie(NULL); cout << fixed << setprecision(12);
#define sim             template<typename T
#define ris             return *this
#define dor             > debug & operator <<
#define eni(x)          sim > typename enable_if<sizeof dud<T>(0) x 1, debug&>::type operator<<(T i)
sim> struct rge { T b, e; };
sim> rge<T> range(T i, T j) { return rge<T>{i, j}; }
sim> auto dud(T *x) -> decltype(cerr << *x, 0);
sim> char dud(...);
struct debug {
#ifdef LOCAL
  ~debug() { cerr << endl; }
  eni(!=) { cerr << boolalpha << i; ris; }
  eni(==) { ris << range(all(i)); }
  sim, typename U dor(pair<U, T> d) { ris << "(" << d.first << ", " << d.second << ")"; }
  sim dor(rge<T> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; }
#else
  sim dor(const T&) { ris; }
#endif
};
#define pr(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vb = vector<bool>;

using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = acos(-1);

template <typename T> T gcd(T x, T y) { return (y == 0) ? x : gcd(y, x % y); }
template <typename T, typename ...Targs>
T gcd(T x, Targs ...y){ return gcd(x, gcd(y...)); }

template<typename T> void mini(T& x, T y) { x = min(x, y); }
template<typename T> void maxi(T& x, T y) { x = max(x, y); }
template<typename T, typename U> string to_string(pair<T, U> p) { return to_string(p.F) + " " + to_string(p.S); }
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
// @formatter:on

//
// Created by White Knife on 14/04/20.
//

#ifndef CPP_LIBRARY_TOURIST_GRAPH_HPP_
#define CPP_LIBRARY_TOURIST_GRAPH_HPP_
#include <vector>
#include <queue>
#include <limits>

using namespace std;

template <typename T>
struct graph {
public:
  struct edge {
    int from;
    int to;
    T cost;
  };

  T max_cost;
  std::vector<edge> edges;
  std::vector<std::vector<edge>> g;
  int n;
  
  
  graph(int _n) : n(_n) {
    g.resize(n);
  }
  
//  virtual int add(int from, int to, T cost) = 0;
  
  void add_directed(int from, int to, T cost = 1) {
    g[from].push_back({from, to, cost});
    max_cost = max(max_cost, cost);
  }
  
  void add(int from, int to, T cost = 1) {
    add_directed(from, to, cost);
    add_directed(to, from, cost);
  }
  
  vector<T> bfs(int s) {
    T beet = 0;
    const auto INF = numeric_limits<T>::max();
    vector<T> dist(g.size(), INF);
    vector<queue<int> > ques(max_cost + 1);
    dist[s] = 0;
    ques[0].emplace(s);
    for (T cost = 0; cost <= beet; cost++) {
      auto &que = ques[cost % max_cost];
      while (!que.empty()) {
        int idx = que.front();
        que.pop();
        if (dist[idx] < cost) continue;
        for (auto &e : g[idx]) {
          auto next_cost = cost + e.cost;
          if (dist[e.to] <= next_cost) continue;;
          dist[e.to] = next_cost;
          beet = max(beet, dist[e.to]);
          ques[dist[e.to] % max_cost].emplace(e.to);
        }
      }
    }
    return dist;
  }
  
};

#endif //CPP_LIBRARY_TOURIST_GRAPH_HPP_


class DLine {
public:
  
  void solve(std::istream &cin, std::ostream &cout) {
    int n, x, y;
    cin >> n >> x >> y;
    x--, y--;
    graph<int> g(n);
    for (int i = 0; i < n - 1; ++i) {
      g.add(i, i + 1);
    }
    g.add(x, y);
    vector<int> ans(n);
    for (int s = 0; s < n; s++) {
      vector<int> dist(n, 1e9);
      queue<int> que;
      dist[s] = 0;
      que.push(s);
      while (!que.empty()) {
        int u = que.front();
        que.pop();
        for (auto j : g.g[u]) {
          int too = j.to;
          if (dist[too] == 1e9) {
            dist[too] = dist[u] + 1;
            que.push(too);
          }
        }
      }
      for (int i = s + 1; i < n; i++) ans[dist[i]]++;
    }
    for (int i = 1; i < n; i++) cout << ans[i] << endl;
  }
};

int main() {
    IOS;
	DLine solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 384