#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};

int main() {
	int n, k;
	cin >> n >> k;
	int c = 0;
	int t = 1;
	while (t < k) {
		t -= 1;
		t += n;
		c++;
	}
	cout << c << endl;
}
#include <bits/stdc++.h>
using namespace std;

int main() {
  int a, b;
  cin >> a >> b;
  int cnt = 1;
  while (1) {
    if ((a-1) * (cnt-1) + a >= b) break;
    cnt++;
  }
  if (b == 1) cout << 0 << endl;
  else cout << cnt << endl;
  return 0;
}
