#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
const long long MOD = 1e9 + 7, INF = 1e18;

template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}

signed main()
{
    int N, M;
    cin >> N >> M;
    vector<int> a(N), b(N);
    int last = 0, best = 0, dis = 0;
    vector<int> lastmax(N + 1, 0), bestmax(N + 1, 0), dismax(N + 1, 0), sum(N + 1, 0);
    for (int i = 0; i < N; i++)
    {
        cin >> a[i] >> b[i];
        last += max(a[i], b[i]);
        best += a[i];
        sum[i + 1] += sum[i] + a[i];
        chmax(lastmax[i + 1], last);
        chmax(lastmax[i + 1], lastmax[i]);
        chmax(bestmax[i + 1], best);
        chmax(bestmax[i + 1], bestmax[i]);
    }
    dis = sum[N];
    rrep(i, 0, N)
    {
        dis += max(a[i], b[i]);
        dis -= a[i];
        chmax(dismax[i], dis);
        chmax(dismax[i], dismax[i + 1]);
    }

    int ans = dismax[0];
    dismax[N] = bestmax[N];
    cout << ans << endl;
    for (int i = 1; i < N + 1; i++)
    {
        chmax(ans, dismax[i] + bestmax[i] * (M - 2) + lastmax[i]);
    }
    cout << ans << endl;
}