#include <bits/stdc++.h>
using namespace std;
const long long N = 2 * 1e3 + 7;
const long double pi = 3.14159265359;
const int INF = 1e9 + 7;
const double eps = 1e-9;
const int xi[4] = {-1, 0, +1, 0};
const int yi[4] = {0, +1, 0, -1};
const int xxi[4] = {+1, 0, -1, 0};
const int yyi[4] = {0, -1, 0, +1};
int nm, m, used[N];
vector<int> g[N];
void dfs(int v, int p) {
  used[v] = 1;
  for (auto to : g[v]) {
    if (!used[to]) {
      dfs(to, v);
    } else {
      if (v != p) {
        cout << "YES";
        exit(0);
      }
    }
  }
}
long long n, k;
int main() {
  ios_base::sync_with_stdio();
  cin.tie(0);
  cout.tie(0);
  srand(time(0));
  ;
  cin >> n >> k;
  if (n >= k) {
    cout << 1;
    return 0;
  }
  cout << k / n + (k % n != 0);
}
