#include <bits/stdc++.h>
using namespace std;

long long a = 1, b = 1000000;

void simpl(long long& u, long long& v) {
    long long G = __gcd(u,v);
    u /= G; v /= G;
}

bool doIteration(vector<pair<long long, long long>>& AB, int k) {
    //a-bx a-b(u/v) av-bu
    int n = AB.size(), i;
    vector<pair<long long, int>> U(n);
    i = -1; while (++i < n) {
        U[i].first = AB[i].first*b-AB[i].second*a;
        U[i].second = i;
    }
    sort(U.begin(), U.end());
    long long S = 0, d = 0;
    i = n-k-1; while (++i < n) {
        int u = U[i].second;
        S += AB[u].first; d += AB[u].second;
    }
    simpl(S,d);
    if (S == a && d == b) return false;
    a = S; b = d;
    return true;
}

bool comp(pair<long long, long long> u, pair<long long, long long> v) {
    //u.first/u.second < v.first/v.second
    return u.first*v.second < u.second*v.first;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n,k,i; cin >> n >> k;
    vector<pair<long long, long long>> AB(n);
    i = -1; while (++i < n) cin >> AB[i].first >> AB[i].second;
    sort(AB.begin(), AB.end(), comp);
    while (true) {
        if (!doIteration(AB, k)) break;
    }
    cout << a << " " << b << "\n";
    
    return 0;
}