#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;

int M, N, K;
int KOR, CHI;
vector<pair<int, int>> cand;

void input() {
    cin >> M >> N >> K;
    cand = vector<pair<int, int>>(M);
    for (int i = 0; i < M; ++i) {
        cin >> cand[i].first >> cand[i].second;
    }
}

vector<int> calcB(int A, int idx) {
    vector<int> b;
    for (int i = idx; i < M; ++i) {
        b.push_back(cand[i].first * A + cand[i].second * (100 - A));
    }
    return b;
}

int selectC(int A, int B, int i) {
    // KOR * A > cand[i].first * A + K * (100 - A)
    int C = 100 - A - B;
    if (C == 0)
        return 1e9;
    int res = (KOR * A + CHI * B + 1 - cand[i].first * A - cand[i].second * B + C - 1) / C;
    //cout << "K: " << res << " " << endl;
    return res;
}

bool isPossible(int A) {
    int k = 0;
    int idx = 0;
    while (idx < cand.size() && KOR == cand[idx].first) idx++;
    if (idx + N > cand.size()) {
        return true;
    }

    for (int B = 0; B <= (100 - A); ++B) {
        k = 0;
        vector<bool> selectedB(M, false);

        for (int i = idx; i < M; ++i) {
            if (cand[i].first * A + cand[i].second * B > KOR * A + CHI * B) {
                selectedB[i] = true;
                k++;
            }
        }
        int numC = 0;
        for (int i = idx; k < N && i < M; ++i) {
            if (selectedB[i]) continue;
            k++;
            numC += selectC(A, B, i);
        }
        if (k < N || numC <= K) return false;
    }
    return true;
}

void solve() {
    sort(cand.begin(), cand.end(), greater<pair<int, int>>());
    for (int i = 0; i < cand.size(); ++i) {
        cout << cand[i].first << " " << cand[i].second << endl;
    }
    KOR = cand[0].first;
    CHI = cand[0].second;

    for (int A = 0; A < 100; ++A) {
        if (isPossible(A)) {
            cout << A << endl;
            return;
        }
    }
    cout << "100" << endl;
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        input();
        solve();
    }
}