#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long u64;
const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline u64 read_int() {
    u64 x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}

u64 c[70][70];
void init() {
    c[0][0] = 1;
    for (int i = 1; i <= 64; i ++) {
        c[i][0] = 1;
        for (int j = 1; j <= i; j ++) {
            c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
        }
    }
}
u64 get_f(u64 N, int K) {
    if (N == 0) return 0;
    int h = 0;
    for (; h < 64 && 1ull << h <= N; h ++);
    u64 m = 0;
    int k = K;
    for (int i = h - 1; i >= 0 && k >= 1; i --) {
        if (N >> i & 1) {
            k --;
        } else {
            m += c[i][k - 1];
        }
    }
    k = K - 1;
    for (int i = h - 1; i >= 0 && k >= 0; i --) {
        if (i == 0 || (N >> i - 1 & 1)) {
            m += c[i][k];
            k --;
        }
    }
    return m;
}

int main() {
    init();
    for (int T = read_int(); T --; ) {
        u64 M = read_int();
        int K = read_int();
        if (M > c[64][K - 1]) {
            printf("0 0\n");
        } else {
            u64 nl = 0, nr = 0;
            for (int i = 63; i >= 0; i --) {
                if (get_f(nl | 1ull << i, K) < M) {
                    nl |= 1ull << i;
                }
                if (get_f(nr | 1ull << i, K) <= M) {
                    nr |= 1ull << i;
                }
            }
            printf("%llu %llu\n", nl + 1, nr - nl);
        }
    }
    return 0;
}