import java.util.Scanner

class UnionFindTree(n: Int) {
  val par: Array[Int] = init(n)

  def init(n: Int): Array[Int] = {
    val a = new Array[Int](n)
    for (i <- 0 until n) {
      a(i) = i
    }
    a
  }

  def root(x: Int): Int = {
    if (par(x) == x) {
      x
    } else {
      par(x) = root(par(x))
      par(x)
    }
  }

  def same(x: Int, y: Int): Boolean = {
    root(x) == root(y)
  }

  def unite(x: Int, y: Int): Unit = {
    val (xx, yy) = (root(x), root(y))
    if (!(xx == yy)) {
      par(xx) = yy
    }
  }

  def isParent(x: Int): Boolean = {
    par(x) == x
  }
}

object Main {
  def main(args: Array[String]): Unit = {
    val sc = new Scanner(System.in)
    val a, b = sc.nextInt()

    println(f(a, b, 1))
  }

  def f(a: Int, b: Int, acc: Int): Int = {
    if (acc >= b) {
      0
    } else {
      1 + f(a, b, acc + a-1)
    }
  }
}