#include <iostream>
using namespace std;
int main(){
int A;
  int B;
  cin>>A>>B;
  int holes=1;
int ans=0;
  while(holes<B){
  holes--;
  holes+=A;
    ans++;
  }
  cout<<ans;
}
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;

const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];

Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;

Int ceilS(Int x,Int y){
    return (x+y-1)/y;
}
using D=long double;

Int perform(Int x){
    return (x*(x+1))/2LL;
}

int main()
{
        cin>>N>>M;
        --M;--N;
        cout<<ceilS(M,N)<<"\n";
        
        
}
