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

int main() 
{    
    int N;
    cin >> N;
    
    vector<pair<long long, long long>> pairs;    
    
    for(int i=0; i<N; i++)
    {
        long long a, b;
        cin >> a >> b;            

        pairs.push_back({a, b});
    }
       
    int K;
    cin >> K;        
    
    sort(pairs.begin(), pairs.end(), [&](pair<long long, long long> a, pair<long long, long long> b)
     {
        return ((a.second * log(a.first)) < (b.second * log(b.first)));
     });
    
    cout << pairs[K-1].first << " " << pairs[K-1].second;
    return 0;
}

from math import log
v = []
for _ in range(int(input())):
    a, b = map(int, input().split())
    v.append((b*log(a), a,b))
k = int(input())
x, a, b = sorted(v)[k-1]
print (a, b)

2
57592  651791025
10000 775690333
1

57592  651791025

2
135366 5167045
10 26514741
1

10 26514741