#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

struct Edge{
    int to;
    int weight;
    Edge(int t, int w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    int weight;
    edge(int f,int t,int w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

bool isPalindrome(string s){
    string t = s;
    reverse(all(t));
    return s==t;
}

constexpr ll LNF = 1e18+7;

constexpr int INF = 1e9+7;

vector<int> dx = {-1,0,1,0};
vector<int> dy = {0,-1,0,1};

/* template */

template<class T>
struct self_queue{
    private:
      std::stack<T> first,second;

      void slide(){
          assert(second.empty());
          while(!first.empty()){
              second.push(first.top());
              first.pop();
          }
      }
    
    public:

      self_queue(){}
      
      T front(){
          if(second.empty()){
              slide();
          }
          assert(!second.empty());
          return second.top();
      }
      
      void pop(){
          if(second.empty()){
              slide();
          }
          assert(!second.empty());
          second.pop();
      }

      void push(T e){
          first.push(e);
      }

      int size(){
          return first.size()+second.size();
      }

      bool empty(){
          return !size();
      }
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,x,y;
    cin >> n >> x >> y;
    x--; y--;
    graph g(n);
    rep(i,0,n-1){
        g[i].emplace_back(i+1);
        g[i+1].emplace_back(i);
    }
    g[x].emplace_back(y);
    g[y].emplace_back(x);
    vector<int> c(n,INF);
    vector<int> s(n,0);
    self_queue<int> que;
    rep(i,0,n){
        que.push(i);
        c.assign(n,INF);
        c[i] = 0;
        while(!que.empty()){
            int t = que.front();
            que.pop();
            for(auto nt: g[t]){
                if(c[nt]>c[t]+1){
                    que.push(nt);
                    chmin(c[nt],c[t]+1);
                }
            }
        }
        rep(i,0,n){
            s[c[i]]++;
        }
    }
    rep(i,1,n){
        s[i] /=2;
        cout << s[i] << endl;
    }
}

Measured memory_bytes: 384