#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
using namespace std;

int p, n, k, d[50][50], s[50][50];

int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    for (int i = 1; i < 50; i++) {
        for (int j = 1; j < 50; j++) {
            d[i][j] = j < i ? d[j][j] : s[i - 1][j - 1] + j;
            s[i][j] = s[i][j - 1] + d[i][j];
            if (d[i][j] > 1000)
                break;
        }
    }

    scanf("%d", &p);
    for (int tst = 1; tst <= p; tst++) {
        scanf("%*d%d%d", &n, &k);
        int r;
        for (r = 0; r < 50 && d[n][r] < k; r++);
        printf("%d %d\n", tst, n == 1 ? k : r);
    }

    return 0;
}