mod = 1000000007
eps = 10 ** -9


def main():
    import sys
    input = sys.stdin.readline

    N, D = map(int, input().split())
    P = []
    Q = []
    for _ in range(N):
        p, q = map(int, input().split())
        P.append(p)
        Q.append(q)

    ok = -10 ** 9
    ng = 0
    mid = (ok + ng) // 2
    while ng - ok > 1:
        prev = -1
        cur = 0
        flg = 1
        for d in range(D-2):
            best = -10 ** 9
            best_i = []
            for i in range(N):
                if cur - P[i] < mid:
                    continue
                if i == prev:
                    continue
                cur_new = cur - P[i] + Q[i]
                if cur_new > best:
                    best_i = [i]
                    best = cur_new
                elif cur_new == best:
                    best_i.append(i)
            if not best_i:
                flg = 0
                break
            if len(best_i) > 1:
                prev = -1
            else:
                prev = best_i[0]
            cur = best

        flg2 = 0
        for i in range(N):
            if i == prev:
                continue
            if cur - P[i] < mid:
                continue
            cur_new_i = cur - P[i] + Q[i]
            for j in range(N):
                if j == i:
                    continue
                if cur_new_i - P[j] >= mid:
                    flg2 = 1
        if flg2 == 0:
            flg = 0

        if flg == 0:
            ng = mid
        else:
            ok = mid
        mid = (ok + ng) // 2
    print(ok)


if __name__ == '__main__':
    main()