Untitled

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;

typedef signed long long i64;
typedef unsigned long long u64;

#define pi pair<int, int>
#define modd 1000000000000000001
#define ll long long
#define ld long double
#define fu(i, m, n) for (ll i = (m); i < (n); ++i)
#define fr(i, S, E) for (typeof(E) i = (S); i != (E); ++i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef unsigned long long ull; 
typedef unsigned int ui;

using namespace std;

int main()
{
ll t;cin>>t;
 vector<ll>v;
 
 unordered_map<ll,ll>m;
    ll x=2;
    while(x<=(ll)1000000000000000001)
    {
        m[x]=1;
        x=x*2;

    }
while(t--)
{
    
    ll a,b;
    cin>>a>>b;
   

   
    if(m[b]) cout<<"Yes\n";
    else
    cout<<"No\n";}}