#include <bits/stdc++.h>

using namespace std;

#define TRACE 1
#define tcout TRACE && cout

#define int long long

int a[30];

void solve()
{
	int l, r;
	cin >> l >> r;
	int s = 0;
	for(int i=1; ; i++)
	{
		if(l * a[i] <= r)
		{
			s = i;
		}
		else
		{
			break;
		}
	}
	cout << s << " ";
	int x = r / a[s];
	//cout << "x=" << x << endl;
	int ans = 0;
	if(x >= l)
	{
		ans += x - l + 1;
	}
	
	int y = r / 3 / a[s-1];
	//cout << "y=" << y << endl;
	if(y >= l)
	{
		ans += (y - l + 1) * (s-1);
	}
	
	cout << ans << endl;
}

signed main()
{
	a[0] = 1;
	a[1] = 1;
	for(int i=2; i<=25; i++)
	{
		a[i] = 2 * a[i-1];
	}
	int t;
	cin >> t;
	while(t--)
	{
		solve();
	}
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

#define TRACE 1
#define tcout TRACE && cout

#define int long long

void solve()
{
	string a, b;
	cin >> a >> b;
	if(a == b)
	{
		cout << "YES\n";
		cout << a << endl;
		return;
	}
	if(a[0] == b[0])
	{
		cout << "YES\n";
		cout << a[0] << "*" << endl;
		return;
	}
	if(a.back() == b.back())
	{
		cout << "YES\n";
		cout << "*" << a.back() << endl;
		return;
	}
	for(int i=0; i<a.size()-1; i++)
	{
		string c = a.substr(i, 2);
		if(b.find(c) != string::npos)
		{
			cout << "YES\n";
			cout << "*" << a[i] << a[i+1] << "*" << endl;
			return;
		}
	}
	cout << "NO\n";
}

signed main()
{
	int t;
	cin >> t;
	while(t--)
	{
		solve();
	} 
	return 0;
}