import java.util.*

fun main(args : Array<String>) {
    val (n, x, y) = readLine()!!.split(' ').map(String::toInt)
    val q = ArrayDeque<Int>()
    val r = IntArray(n + 1) { -1 }
    val s = IntArray(n)
    for (i in 1..n) {
        q.add(i)
        r[i] = 0
        while (q.isNotEmpty()) {
            val v = q.remove()
            val d = r[v]
            if (v != 1 && r[v - 1] == -1) {
                q.add(v - 1)
                r[v - 1] = d + 1
            }
            if (v != n && r[v + 1] == -1) {
                q.add(v + 1)
                r[v + 1] = d + 1
            }
            if (v == x && r[y] == -1) {
                q.add(y)
                r[y] = d + 1
            }
            if (v == y && r[x] == -1) {
                q.add(x)
                r[x] = d + 1
            }
        }
        for (j in 1..n) {
            s[r[j]]++
            r[j] = -1
        }
    }
    for (i in 1 until n) {
        println(s[i] shr 1)
    }
}
