#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>

ll n, m, bnow = 0, anow = 0, a[110000], b[110000], now = 0, ans = 0, ma = MINF;
vector<ll> p;
int main() {
	cin >> n >> m;
	REP(i, n)cin >> a[i] >> b[i];
	REP(i, n) {
		p.push_back(anow + b[i]);
		anow += a[i];
		ma = max(ma, anow);
	}
	sort(ALL(p), greater<ll>());
	REP(i, min(m, (ll)p.size())) {
		if (p[i] < ma)break;
		ans += p[i];
		now++;
	}
	cout << ma << endl;
	ans += (m - now) * ma;
	ll a2 = 0;
	REP(i, n)a2 += b[i];
	cout << max(ans, a2) << endl;
}