5 3
 1000 3
 777 17
 4 3
 2 2
 100 4
 10 4
 999 2
 6 4
 1 2
 17 3
 1 4
 26 8
 91 5
 1 3
 1000 2
 20 3
 9 4
 123 5
 1000 1000
 3 2
 3 3
 80 970
 1000 4
 1 1000

7
 1499
 825
 5
 3
 133
 13
 1997
 7
 1
 25
 1
 29
 113
 1
 1999
 29
 11
 153
 1001
 5
 4
 80
 1333
 1

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,fast-math")
inline void setup() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
}
inline void solve();
int main(int argc, char* argv[]) {
  setup();
  long long t = 1;
  while (t--) solve();
  return 0;
}
using namespace std;
inline void solve() {
  long long a, b;
  cin >> a >> b;
  long long newCandles = a;
  long long burnedOut = 0;
  long long ans = 0;
  while (newCandles || burnedOut >= b) {
    ans += newCandles;
    burnedOut += newCandles;
    newCandles = (burnedOut / b);
    burnedOut -= (newCandles * b);
  }
  cout << ans + newCandles;
}
