#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, d; cin >> n >> d;
  vector<int> p(n), q(n); REP(i, n) cin >> p[i] >> q[i];
  int lb = d * -*max_element(ALL(p)), ub = 0;
  while (ub - lb > 1) {
    int least = (lb + ub) / 2;
    vector<int> dp(n, 0);
    REP(_, d) {
      vector<int> idx(n);
      iota(ALL(idx), 0);
      sort(ALL(idx), [&](int a, int b) -> bool { return dp[a] > dp[b]; });
      vector<int> nx(n, -INF);
      REP(i, n) {
        int yest = dp[idx.front() == i ? idx[1] : idx.front()];
        if (yest - p[i] >= least) nx[i] = yest - p[i] + q[i];
      }
      dp.swap(nx);
    }
    (*max_element(ALL(dp)) != -INF ? lb : ub) = least;
  }
  cout << lb << '\n';
  return 0;
}