给40亿个不重复的unsigned int的数，没排序，然后再给一个数，如何快速间断这个数是否在那40亿个数中

#include <iostream>
#include <bitset>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

#define maxn 62500000
unsigned long long a[maxn];

int main() {
    unsigned n, m, x;
    while (cin >> n >> m) {
        memset(a, 0, sizeof(a));
        for (int i=0; i<n; i++) {
            cin >> x;
            a[ x>>5 ] |= 1 << (x & 0x3F);
        }
        for (int i=0; i<m; i++) {
            cin >> x;
            if ( a[x>>5] & ( 1 << (x & 0x3F) ) ) {
                cout << "Yes" << endl;
            } else {
                cout << "No" << endl;
            }
        }
    }
}