stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()

{

    int i,j,k,n,m,c,t,y,mx,x;

    cin>>n>>x>>y;

    if(x>y) swap(x,y);k=y-x-1;//k=max(k,0);

    map<int,int>mp;

    for(i=1;i<n;i++){

        for(j=i+1;j<=n;j++){

            c=j-i;

            c=min(c,abs(i-x)+abs(j-y)+1);

           // c=min(c,abs(i-y)+abs(j-x));

            mp[c]++;

           // cout<<i<<" "<<j<<" ="<<c<<endl;

        }

    }

    for(i=1;i<n;i++){

        printf("%d\n",mp[i]);

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.167068228138565x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;

typedef long long ll;

const int maxn = 2010;



int n, x, y;

int ans[maxn];



int main() {

    int len;

    scanf("%d%d%d", &n, &x, &y);

    for (int i = 1; i < n; i++) {

        for (int j = i + 1; j <= n; j++) {

            if (i <= x) {

                len = min(j - i, x - i + 1 + abs(y - j));

            } else {

                len = min(j - i, i - x + 1 + abs(y - j));

            }

            ans[len]++;

        }

    }

    for(int i=1;i<n;i++){

        printf("%d\n",ans[i]);

    }

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



const int MAXN = 2100;

int n, x, y, a, b;

set<pair<int, int>> resp[MAXN];

int mark[MAXN];



void bfs(int u){

	memset(mark, -1, sizeof(mark));

	queue<int> Q;

	Q.push(u);

	mark[u] = 0;

	while(!Q.empty()){

		int v = Q.front();

		Q.pop();

		resp[mark[v]].insert({min(u, v), max(u, v)});

		if (v < n-1 && mark[v+1] == -1){

			mark[v+1] = mark[v] + 1;

			Q.push(v+1);

		}

		if (v > 0 && mark[v-1] == -1){

			mark[v-1] = mark[v] + 1;

			Q.push(v-1);

		}

		if(v == x && mark[y] == -1){

			mark[y] = mark[v]+1;

			Q.push(y);

		}

		if (v == y && mark[x] == -1){

			mark[x] = mark[v]+1;

			Q.push(x);

		}

	}

}



int main(){

	//memset(resp, 0, sizeof(resp));

	cin >> n >> a >> b;

	a--; b--;	

	x = min(a, b);

	y = max(a, b);



	for (int i = 0; i < n; i++){

		bfs(i);

	}



	for (int i = 1; i < n; i++){

		//cout << "I ----- " << i << endl;

		cout << resp[i].size() << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.0934518821192567x):
#include <bits/stdc++.h>

using namespace std;

 

#define ll long long

#define ii pair<int, int>

#define dd pair<double, double>

#define pb(i) push_back(i)





int dir1[4] = {0, 0, 1, -1};

int dir2[4] = {1, -1, 0, 0};

 

int n;

vector< set<ii> > p;

vector<vector<int> > adj;

vector<bool> visited;

vector<int> dist;

 

void bfs(int u){

    int ind = u;

    int i, j;

 

    fill(visited.begin(), visited.end(), false);

    visited[u] = true;

 

    fill(dist.begin(), dist.end(), -1);

    dist[u] = 0;

 

    queue<int> q;

    q.push(u);

    while(!q.empty()){

        u = q.front();

        q.pop();

 

        for(i = 0; i < adj[u].size(); i++)

        {

            int v = adj[u][i];

            if(!visited[v])

            {

                visited[v] = true;

                dist[v] = dist[u] + 1;

                q.push(v);

            }

        }

    }

 

    for(int i = 1; i <= n; i++)

        if(dist[i] != -1)

        {

            int a = ind, b = i;

            if(a > b)

                swap(a, b);

            p[dist[i]].insert(ii(a, b));

        }

}

 

int main(){

    int i, j;

 

    int x, y;

    cin >> n >> x >> y;

 

    adj.resize(n+5);

    for(i = 1; i < n; i++){

        adj[i].pb(i+1); 

        adj[i+1].pb(i);

    }

 

    adj[x].pb(y);

    adj[y].pb(x);

 

    p.resize(n+5);

    dist.resize(n+5);

    visited.resize(n+5);

    for(i = 1; i <= n; i++)

        bfs(i);

    

 

    for(i = 1; i < n; i++)

        cout << p[i].size() << '\n';

    

 

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



const int MAXN = 2100;

int n, x, y, a, b;

set<pair<int, int>> resp[MAXN];

int mark[MAXN];



void bfs(int u){

	memset(mark, -1, sizeof(mark));

	queue<int> Q;

	Q.push(u);

	mark[u] = 0;

	while(!Q.empty()){

		int v = Q.front();

		Q.pop();

		resp[mark[v]].insert({min(u, v), max(u, v)});

		if (v < n-1 && mark[v+1] == -1){

			mark[v+1] = mark[v] + 1;

			Q.push(v+1);

		}

		if (v > 0 && mark[v-1] == -1){

			mark[v-1] = mark[v] + 1;

			Q.push(v-1);

		}

		if(v == x && mark[y] == -1){

			mark[y] = mark[v]+1;

			Q.push(y);

		}

		if (v == y && mark[x] == -1){

			mark[x] = mark[v]+1;

			Q.push(x);

		}

	}

}



int main(){

	//memset(resp, 0, sizeof(resp));

	cin >> n >> a >> b;

	a--; b--;	

	x = min(a, b);

	y = max(a, b);



	for (int i = 0; i < n; i++){

		bfs(i);

	}



	for (int i = 1; i < n; i++){

		//cout << "I ----- " << i << endl;

		cout << resp[i].size() << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.1952418857265883x):
//Bismillahir Rahmanir Rahim

#include <bits/stdc++.h>

using namespace std;



typedef long long              ll;

typedef long double            ld;

typedef pair<int, int>         pi;

typedef vector<int>            vi;

typedef vector<pair<int, int>> vpi;



#define pb       push_back

#define all(x)   begin(x), end(x)

#define sz(x)    (int)(x).size()

#define ff       first

#define ss       second

#define mp       make_pair

#define lb       lower_bound

#define ub       upper_bound

#define tcase()  int t; cin >> t; while(t--)



const int MOD = 1e9 + 7; // 998244353;

const int MX  = 2e5 + 5;

const ll  INF = 1e18;

const ld  PI  = acos((ld) -1);



void setIO(string name = "") {

    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    if(sz(name)){

        freopen((name+".in").c_str(), "r", stdin);

        freopen((name+".out").c_str(), "w", stdout);

    }

}



int main(){



    setIO();



    int n, l, r;

    cin >> n >> l >> r;



    int dif = r - l - 1;



    int arr[n + 1] = {0};



    for(int i = 1; i <= n; i++){

        for(int j = i + 1; j <= n; j++){

            arr[min({j - i, abs(l - i) + 1 + abs(j - r)})]++;

        }

    }



    for(int i = 1; i < n; i++) cout << arr[i] << "\n";

}
// Slower C++ solution:
//nani?

//omo ta tori da

#include<bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp> // Common file

#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

#include <ext/pb_ds/detail/standard_policies.hpp>

#define pi acos(-1);

#define fs first

#define sc second

#define pb push_back

#define mp make_pair

#define f(i,a,b) for( int i = a; i < b ; i++ )

#define sor(a) sort( a.begin(), a.end() )

#define rsor(a) sort( a.rbegin(), a.rend() )

#define fastio ios_base::sync_with_stdio(0);cin.tie(0)

#define inf 1LL<<62

typedef long long ll;

typedef double ld;

using namespace std;

using namespace __gnu_pbds;

//const ll inf=1e10;

const ll MOD=1e9+7;

const ll mod=998244353;

const ll N = 1e7 + 5;

// ac cmtr;

const int MAX_N = 2e5+5;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;

 

#define TRACE

#ifdef TRACE

#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)

template <typename Arg1>

void __f(const char* name, Arg1&& arg1) {

  cout << name << " : " << arg1 << endl;}

 

template <typename Arg1, typename... Args>

void __f(const char* names, Arg1&& arg1, Args&&... args) {

  const char* comma = strchr(names + 1, ',');

  cout.write(names, comma - names) << " : " << arg1<<" | ";

  __f(comma+1, args...);}

#else

#define trace(...)

#endif

//---------------------------



ll dp[2005][2005];

ll cnt[MAX_N];

ll n;

vector <pair <ll,ll > > adj[MAX_N];



void dij(ll a){



    set <pair <ll,ll> > s;

    f(i,0,n+1) {dp[i][a]=inf;}

    s.insert(mp(0,a));

    dp[a][a] = 0;

    //ans[a] = 1;

    while(!s.empty()){

        ll ini  = s.begin()->sc;s.erase(s.begin());

        for(auto xd : adj[ini]){

            if(dp[xd.fs][a] > dp[ini][a] + xd.sc){

                s.erase(mp(dp[xd.fs][a],xd.fs)); 

                //ans[xd.fs] = ans[ini];

                dp[xd.fs][a] = dp[ini][a] + xd.sc;

                s.insert(mp(dp[xd.fs][a],xd.fs));

            }

        }

        

    }

  return;

}



int main(){

    fastio;

    ll x,y;

    cin>>n>>x>>y;

    f(i,1,n){

        adj[i].pb({i+1,1});

        adj[i+1].pb({i,1});

    }

    adj[x].pb({y,1});

    adj[y].pb({x,1});

    f(i,1,n+1){

        dij(i);

    }

    f(i,1,n+1){

        for(int j=1;j<=n;j++){

            cnt[dp[i][j]]++;

        }

    }

    f(i,1,n){

        cout<<cnt[i]/2<<" "<<endl;

    }





   

}

// Faster C++ solution for the same problem (measured speedup: 6.664080120934523x):
#include <bits/stdc++.h>

using namespace std;



const int N = 2123;

int resp[N];



int dist(int a, int b) {

	return abs(a - b);

}



int dist(int a, int b, int x, int y) {

	return min({

		dist(a, b),

		dist(a, x) + dist(b, y) + 1,

		dist(a, y) + dist(b, x) + 1

	});

}



int main() {

	int n, x, y; scanf("%d %d %d", &n, &x, &y);

	for (int i = 0; i < n; i++) {

		for (int j = i+1; j < n; j++) {

			resp[dist(i+1, j+1, x, y)]++;

		}

	}

	for (int i = 1; i < n; i++) {

		printf("%d\n", resp[i]);

	}

}
// Slower C++ solution:
#include "bits/stdc++.h"

using namespace std;



#define pb push_back

#define fr(i, n) for(int i = 0; i < n; i++)

#define frr(i, n) for(int i = 1; i <= n; i++)



#define dbg(x) cout << #x << " = " << x << endl

#define all(x) x.begin(),x.end()

#define ms(x, i) memset(x, i, sizeof(x))



#define p(x) cout << x << "\n"

#define pv(x) fr(i, x.size()) cout << x[i] << " \n"[i==x.size()-1]



#define f first

#define s second



#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)



typedef long long int ll;

typedef long double ld;

typedef pair<int,int> pii;

typedef pair<ll,ll> pll;

typedef vector<int> vi;

typedef vector<ll> vl;



const int INF = 0x3f3f3f3f;

const ll LINF = 0x3f3f3f3f3f3f3f;



#define maxn 2123



vi adj[maxn];

int ans[maxn], vis[maxn];



int main() {

    fastio;

    int n, x, y;

    cin >> n >> x >> y;



    frr(i, n-1) {

        adj[i].pb(i+1);

        adj[i+1].pb(i);

    }



    adj[x].pb(y);

    adj[y].pb(x);



    frr(i, n) {

        ms(vis, 0);



        queue<pii> q;

        q.push({0, i});

        while (!q.empty()) {

            int u = q.front().s;

            int d = q.front().f;

            q.pop();



            if (vis[u]) continue;

            vis[u] = 1;



            if (u > i) ans[d]++;

            for (auto v: adj[u]) q.push({d+1, v});

        }

    }



    frr(i, n-1) p(ans[i]);

}


// Faster C++ solution for the same problem (measured speedup: 1.1201471086290633x):
#include <bits/stdc++.h>

using namespace std;



const int N = 2123;

int resp[N];



int dist(int a, int b) {

	return abs(a - b);

}



int dist(int a, int b, int x, int y) {

	return min({

		dist(a, b),

		dist(a, x) + dist(b, y) + 1,

		dist(a, y) + dist(b, x) + 1

	});

}



int main() {

	int n, x, y; scanf("%d %d %d", &n, &x, &y);

	for (int i = 0; i < n; i++) {

		for (int j = i+1; j < n; j++) {

			resp[dist(i+1, j+1, x, y)]++;

		}

	}

	for (int i = 1; i < n; i++) {

		printf("%d\n", resp[i]);

	}

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define pb push_back

#define inf INT_MAX

#define pii pair<int,int>

#define f first

#define s second

#define mp make_pair

#define mod 1000000009

#define ld long double

#define eps 1e-8

#define MAXN 2123



vector<pii> are[MAXN];

int dis[MAXN];

int val[MAXN];



void dij(int x){

    for(int i=0;i<MAXN;i++)dis[i]=-1;

    priority_queue<pii> q;

    dis[x]=0;q.push(mp(0,x));

    while(!q.empty()){

        x=q.top().s;int c=-q.top().f;q.pop();

        if(dis[x]!=c)continue;

        for(pii at:are[x]){

            int y=at.s,c=at.f;

            if(dis[y]==-1||dis[x]+c<dis[y]){

                dis[y]=dis[x]+c;

                q.push(mp(-dis[y],y));

            }

        }

    }

    for(int i=0;i<MAXN;i++)val[dis[i]]++;

}



int32_t main (){



    ios::sync_with_stdio(false);

    cin.tie(0);

    cout<<setprecision(2)<<fixed;



    int n,x,y;

    cin>>n>>x>>y;

    for(int i=0;i<n-1;i++){

        are[i].pb(mp(1,i+1));

        are[i+1].pb(mp(1,i));

    }

    x--;y--;

    are[x].pb(mp(1,y));

    are[y].pb(mp(1,x));



    for(int i=0;i<n;i++)dij(i);



    for(int i=1;i<n;i++){

        cout<<val[i]/2<<endl;

    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.169433473484624x):
#include <bits/stdc++.h>

using namespace std;



const int N = 2123;

int resp[N];



int dist(int a, int b) {

	return abs(a - b);

}



int dist(int a, int b, int x, int y) {

	return min({

		dist(a, b),

		dist(a, x) + dist(b, y) + 1,

		dist(a, y) + dist(b, x) + 1

	});

}



int main() {

	int n, x, y; scanf("%d %d %d", &n, &x, &y);

	for (int i = 0; i < n; i++) {

		for (int j = i+1; j < n; j++) {

			resp[dist(i+1, j+1, x, y)]++;

		}

	}

	for (int i = 1; i < n; i++) {

		printf("%d\n", resp[i]);

	}

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define pb push_back

#define inf INT_MAX

#define pii pair<int,int>

#define f first

#define s second

#define mp make_pair

#define mod 1000000009

#define ld long double

#define eps 1e-8

#define MAXN 2123



vector<pii> are[MAXN];

int dis[MAXN];

int val[MAXN];



void dij(int x){

    for(int i=0;i<MAXN;i++)dis[i]=-1;

    priority_queue<pii> q;

    dis[x]=0;q.push(mp(0,x));

    while(!q.empty()){

        x=q.top().s;int c=-q.top().f;q.pop();

        if(dis[x]!=c)continue;

        for(pii at:are[x]){

            int y=at.s,c=at.f;

            if(dis[y]==-1||dis[x]+c<dis[y]){

                dis[y]=dis[x]+c;

                q.push(mp(-dis[y],y));

            }

        }

    }

    for(int i=0;i<MAXN;i++)val[dis[i]]++;

}



int32_t main (){



    ios::sync_with_stdio(false);

    cin.tie(0);

    cout<<setprecision(2)<<fixed;



    int n,x,y;

    cin>>n>>x>>y;

    for(int i=0;i<n-1;i++){

        are[i].pb(mp(1,i+1));

        are[i+1].pb(mp(1,i));

    }

    x--;y--;

    are[x].pb(mp(1,y));

    are[y].pb(mp(1,x));



    for(int i=0;i<n;i++)dij(i);



    for(int i=1;i<n;i++){

        cout<<val[i]/2<<endl;

    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.1337213349663993x):
#include <iostream>

#include <vector>

#include <map>

#include <set>

#include <cmath>

#include <algorithm>

#include <iomanip>

#include <queue>

#include <string>

#include <utility>

#include <cassert>



using namespace std;

typedef long long ll;



int main() {

  ios_base::sync_with_stdio(0);

  cin.tie(0);



  int n, x, y;

  cin >> n >> x >> y;



  vector<int> freq(n, 0);



  for (int i = 1; i <= n; i++) {

    for (int j = i+1; j <= n; j++) {

      int d;

      if (j <= x || y <= i) {

        d = j - i;

      } else if (i <= x) {

        d = min(j - i, x - i + 1 + abs(y - j));

      } else {

        d = min(j - i, abs(y - j) + 1 + abs(x - i));

      }

      assert(d > 0);

      freq[d]++;

    }

  }



  for (int i = 1; i < n; i++) {

    cout << freq[i] << endl;

  }



  return 0;

}
// Slower C++ solution:
//nani?

//omo ta tori da

#include<bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp> // Common file

#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

#include <ext/pb_ds/detail/standard_policies.hpp>

#define pi acos(-1);

#define fs first

#define sc second

#define pb push_back

#define mp make_pair

#define f(i,a,b) for( int i = a; i < b ; i++ )

#define sor(a) sort( a.begin(), a.end() )

#define rsor(a) sort( a.rbegin(), a.rend() )

#define fastio ios_base::sync_with_stdio(0);cin.tie(0)

#define inf 1LL<<62

typedef long long ll;

typedef double ld;

using namespace std;

using namespace __gnu_pbds;

//const ll inf=1e10;

const ll MOD=1e9+7;

const ll mod=998244353;

const ll N = 1e7 + 5;

// ac cmtr;

const int MAX_N = 2e5+5;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;

 

#define TRACE

#ifdef TRACE

#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)

template <typename Arg1>

void __f(const char* name, Arg1&& arg1) {

  cout << name << " : " << arg1 << endl;}

 

template <typename Arg1, typename... Args>

void __f(const char* names, Arg1&& arg1, Args&&... args) {

  const char* comma = strchr(names + 1, ',');

  cout.write(names, comma - names) << " : " << arg1<<" | ";

  __f(comma+1, args...);}

#else

#define trace(...)

#endif

//---------------------------



ll dp[2005][2005];

ll cnt[MAX_N];

ll n;

vector <pair <ll,ll > > adj[MAX_N];



void dij(ll a){



    set <pair <ll,ll> > s;

    f(i,0,n+1) {dp[i][a]=inf;}

    s.insert(mp(0,a));

    dp[a][a] = 0;

    //ans[a] = 1;

    while(!s.empty()){

        ll ini  = s.begin()->sc;s.erase(s.begin());

        for(auto xd : adj[ini]){

            if(dp[xd.fs][a] > dp[ini][a] + xd.sc){

                s.erase(mp(dp[xd.fs][a],xd.fs)); 

                //ans[xd.fs] = ans[ini];

                dp[xd.fs][a] = dp[ini][a] + xd.sc;

                s.insert(mp(dp[xd.fs][a],xd.fs));

            }

        }

        

    }

  return;

}



int main(){

    fastio;

    ll x,y;

    cin>>n>>x>>y;

    f(i,1,n){

        adj[i].pb({i+1,1});

        adj[i+1].pb({i,1});

    }

    adj[x].pb({y,1});

    adj[y].pb({x,1});

    f(i,1,n+1){

        dij(i);

    }

    f(i,1,n+1){

        for(int j=1;j<=n;j++){

            cnt[dp[i][j]]++;

        }

    }

    f(i,1,n){

        cout<<cnt[i]/2<<" "<<endl;

    }





   

}

// Faster C++ solution for the same problem (measured speedup: 6.6758701655744614x):
# include <iostream>

# include <cstdio>

# include <cmath>

using namespace std;



// long long A[1000000];

long long N,X,Y;

long long K[40000];

int main(void)

{

    // freopen("aaa.in","r",stdin);

    scanf("%lld%lld%lld",&N,&X,&Y);

    for (long long i=1;i<N;i++)

    {

        for (long long j=i+1;j<=N;j++)

        {

            int kk=min(j-i,abs(i-X)+abs(j-Y)+1);

            K[kk]++;

        }

    }

    for (int i=1;i<N;i++) printf("%lld\n",K[i]);

    return 0;

}
// Slower C++ solution:
#include "bits/stdc++.h"

using namespace std;



#define pb push_back

#define fr(i, n) for(int i = 0; i < n; i++)

#define frr(i, n) for(int i = 1; i <= n; i++)



#define dbg(x) cout << #x << " = " << x << endl

#define all(x) x.begin(),x.end()

#define ms(x, i) memset(x, i, sizeof(x))



#define p(x) cout << x << "\n"

#define pv(x) fr(i, x.size()) cout << x[i] << " \n"[i==x.size()-1]



#define f first

#define s second



#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)



typedef long long int ll;

typedef long double ld;

typedef pair<int,int> pii;

typedef pair<ll,ll> pll;

typedef vector<int> vi;

typedef vector<ll> vl;



const int INF = 0x3f3f3f3f;

const ll LINF = 0x3f3f3f3f3f3f3f;



#define maxn 2123



vi adj[maxn];

int ans[maxn], vis[maxn];



int main() {

    fastio;

    int n, x, y;

    cin >> n >> x >> y;



    frr(i, n-1) {

        adj[i].pb(i+1);

        adj[i+1].pb(i);

    }



    adj[x].pb(y);

    adj[y].pb(x);



    frr(i, n) {

        ms(vis, 0);



        queue<pii> q;

        q.push({0, i});

        while (!q.empty()) {

            int u = q.front().s;

            int d = q.front().f;

            q.pop();



            if (vis[u]) continue;

            vis[u] = 1;



            if (u > i) ans[d]++;

            for (auto v: adj[u]) q.push({d+1, v});

        }

    }



    frr(i, n-1) p(ans[i]);

}


// Faster C++ solution for the same problem (measured speedup: 1.1221288651767596x):
# include <iostream>

# include <cstdio>

# include <cmath>

using namespace std;



// long long A[1000000];

long long N,X,Y;

long long K[40000];

int main(void)

{

    // freopen("aaa.in","r",stdin);

    scanf("%lld%lld%lld",&N,&X,&Y);

    for (long long i=1;i<N;i++)

    {

        for (long long j=i+1;j<=N;j++)

        {

            int kk=min(j-i,abs(i-X)+abs(j-Y)+1);

            K[kk]++;

        }

    }

    for (int i=1;i<N;i++) printf("%lld\n",K[i]);

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define pb push_back

#define inf INT_MAX

#define pii pair<int,int>

#define f first

#define s second

#define mp make_pair

#define mod 1000000009

#define ld long double

#define eps 1e-8

#define MAXN 2123



vector<pii> are[MAXN];

int dis[MAXN];

int val[MAXN];



void dij(int x){

    for(int i=0;i<MAXN;i++)dis[i]=-1;

    priority_queue<pii> q;

    dis[x]=0;q.push(mp(0,x));

    while(!q.empty()){

        x=q.top().s;int c=-q.top().f;q.pop();

        if(dis[x]!=c)continue;

        for(pii at:are[x]){

            int y=at.s,c=at.f;

            if(dis[y]==-1||dis[x]+c<dis[y]){

                dis[y]=dis[x]+c;

                q.push(mp(-dis[y],y));

            }

        }

    }

    for(int i=0;i<MAXN;i++)val[dis[i]]++;

}



int32_t main (){



    ios::sync_with_stdio(false);

    cin.tie(0);

    cout<<setprecision(2)<<fixed;



    int n,x,y;

    cin>>n>>x>>y;

    for(int i=0;i<n-1;i++){

        are[i].pb(mp(1,i+1));

        are[i+1].pb(mp(1,i));

    }

    x--;y--;

    are[x].pb(mp(1,y));

    are[y].pb(mp(1,x));



    for(int i=0;i<n;i++)dij(i);



    for(int i=1;i<n;i++){

        cout<<val[i]/2<<endl;

    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.1715024271294803x):
# include <iostream>

# include <cstdio>

# include <cmath>

using namespace std;



// long long A[1000000];

long long N,X,Y;

long long K[40000];

int main(void)

{

    // freopen("aaa.in","r",stdin);

    scanf("%lld%lld%lld",&N,&X,&Y);

    for (long long i=1;i<N;i++)

    {

        for (long long j=i+1;j<=N;j++)

        {

            int kk=min(j-i,abs(i-X)+abs(j-Y)+1);

            K[kk]++;

        }

    }

    for (int i=1;i<N;i++) printf("%lld\n",K[i]);

    return 0;

}