#include <bits/stdc++.h>
using namespace std;
vector<long long> f(55);
void prepare() {
f[1] = 1;
for (int i = 2; i < f.size(); ++i) {
f[i] = f[i - 1] * 2;
}
}
void testCase() {
long long n, k;
cin >> n >> k;
for (int i = n; i >= 1; --i) {
if (k > f[i]) k -= f[i];
else if (k == f[i]) {
cout << i;
return;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
prepare();
int T = 1; cin >> T;
while (T--) {
testCase();
cout << "\n";
}
return 0;
}
CiNpbmNsdWRlIDxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdmVjdG9yPGxvbmcgbG9uZz4gZig1NSk7CnZvaWQgcHJlcGFyZSgpIHsKICAgIGZbMV0gPSAxOwogICAgZm9yIChpbnQgaSA9IDI7IGkgPCBmLnNpemUoKTsgKytpKSB7CiAgICAgICAgZltpXSA9IGZbaSAtIDFdICogMjsKICAgIH0KfQoKdm9pZCB0ZXN0Q2FzZSgpIHsKICAgIGxvbmcgbG9uZyBuLCBrOwogICAgY2luID4+IG4gPj4gazsKICAgIGZvciAoaW50IGkgPSBuOyBpID49IDE7IC0taSkgewogICAgICAgIGlmIChrID4gZltpXSkgayAtPSBmW2ldOwogICAgICAgIGVsc2UgaWYgKGsgPT0gZltpXSkgewogICAgICAgICAgICBjb3V0IDw8IGk7CiAgICAgICAgICAgIHJldHVybjsKICAgICAgICB9CiAgICB9Cn0KCmludCBtYWluKCkgewogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKE5VTEwpOyBjb3V0LnRpZShOVUxMKTsKCiAgICBwcmVwYXJlKCk7CiAgICBpbnQgVCA9IDE7IGNpbiA+PiBUOwogICAgd2hpbGUgKFQtLSkgewogICAgICAgIHRlc3RDYXNlKCk7CiAgICAgICAgY291dCA8PCAiXG4iOwogICAgfQogICAgcmV0dXJuIDA7Cn0=