#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main() {
    int T;
    cin >> T;  // 输入测试用例数量
    while (T--) {
        int n;
        cin >> n;  // 读取每个测试用例的回合数
        vector<int> s(n);  // 存储 Bob 的出拳序列
        for (int i = 0; i < n; ++i) {
            cin >> s[i];
        }
 
        // 读取 Alice 的出拳的三种可能的值
        int a, b, c;
        cin >> a >> b >> c;
 
        // 对 Alice 的出拳进行排序
        vector<int> alice_scores = {a, b, c};
        sort(alice_scores.rbegin(), alice_scores.rend());  // 按从大到小排序
 
        // 统计 Bob 出拳的频率
        vector<int> bob_count(3, 0);  // Bob 的出拳 0, 1, 2 的计数
        for (int i = 0; i < n; ++i) {
            bob_count[s[i]]++;
        }
 
        int win_count = 0;
 
        // 贪心策略，尽可能选择 Alice 的较大分数来击败 Bob 的较小分数
        // 处理 Alice 的分数从最大到最小与 Bob 进行比较
        for (int i = 0; i < 3; ++i) {
            for (int j = 0; j < 3; ++j) {
                // Alice 的出拳比 Bob 的出拳大且 Bob 的该出拳仍有剩余
                if (alice_scores[i] > j && bob_count[j] > 0) {
                    win_count++;
                    bob_count[j]--;  // Bob 用过一次该分数
                    break;  // 一旦匹配成功，跳到 Alice 的下一个出拳
                }
            }
        }
 
        // 输出当前测试用例的 Alice 获胜的次数
        cout << win_count << endl;
    }
 
    return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICBpbnQgVDsKICAgIGNpbiA+PiBUOyAgLy8g6L6T5YWl5rWL6K+V55So5L6L5pWw6YePCiAgICB3aGlsZSAoVC0tKSB7CiAgICAgICAgaW50IG47CiAgICAgICAgY2luID4+IG47ICAvLyDor7vlj5bmr4/kuKrmtYvor5XnlKjkvovnmoTlm57lkIjmlbAKICAgICAgICB2ZWN0b3I8aW50PiBzKG4pOyAgLy8g5a2Y5YKoIEJvYiDnmoTlh7rmi7Pluo/liJcKICAgICAgICBmb3IgKGludCBpID0gMDsgaSA8IG47ICsraSkgewogICAgICAgICAgICBjaW4gPj4gc1tpXTsKICAgICAgICB9CiAgICAgICAgCiAgICAgICAgLy8g6K+75Y+WIEFsaWNlIOeahOWHuuaLs+eahOS4ieenjeWPr+iDveeahOWAvAogICAgICAgIGludCBhLCBiLCBjOwogICAgICAgIGNpbiA+PiBhID4+IGIgPj4gYzsKCiAgICAgICAgLy8g5a+5IEFsaWNlIOeahOWHuuaLs+i/m+ihjOaOkuW6jwogICAgICAgIHZlY3RvcjxpbnQ+IGFsaWNlX3Njb3JlcyA9IHthLCBiLCBjfTsKICAgICAgICBzb3J0KGFsaWNlX3Njb3Jlcy5yYmVnaW4oKSwgYWxpY2Vfc2NvcmVzLnJlbmQoKSk7ICAvLyDmjInku47lpKfliLDlsI/mjpLluo8KICAgICAgICAKICAgICAgICAvLyDnu5/orqEgQm9iIOWHuuaLs+eahOmikeeOhwogICAgICAgIHZlY3RvcjxpbnQ+IGJvYl9jb3VudCgzLCAwKTsgIC8vIEJvYiDnmoTlh7rmi7MgMCwgMSwgMiDnmoTorqHmlbAKICAgICAgICBmb3IgKGludCBpID0gMDsgaSA8IG47ICsraSkgewogICAgICAgICAgICBib2JfY291bnRbc1tpXV0rKzsKICAgICAgICB9CiAgICAgICAgCiAgICAgICAgaW50IHdpbl9jb3VudCA9IDA7CgogICAgICAgIC8vIOi0quW/g+etlueVpe+8jOWwveWPr+iDvemAieaLqSBBbGljZSDnmoTovoPlpKfliIbmlbDmnaXlh7votKUgQm9iIOeahOi+g+Wwj+WIhuaVsAogICAgICAgIC8vIOWkhOeQhiBBbGljZSDnmoTliIbmlbDku47mnIDlpKfliLDmnIDlsI/kuI4gQm9iIOi/m+ihjOavlOi+gwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgMzsgKytpKSB7CiAgICAgICAgICAgIGZvciAoaW50IGogPSAwOyBqIDwgMzsgKytqKSB7CiAgICAgICAgICAgICAgICAvLyBBbGljZSDnmoTlh7rmi7Pmr5QgQm9iIOeahOWHuuaLs+Wkp+S4lCBCb2Ig55qE6K+l5Ye65ouz5LuN5pyJ5Ymp5L2ZCiAgICAgICAgICAgICAgICBpZiAoYWxpY2Vfc2NvcmVzW2ldID4gaiAmJiBib2JfY291bnRbal0gPiAwKSB7CiAgICAgICAgICAgICAgICAgICAgd2luX2NvdW50Kys7CiAgICAgICAgICAgICAgICAgICAgYm9iX2NvdW50W2pdLS07ICAvLyBCb2Ig55So6L+H5LiA5qyh6K+l5YiG5pWwCiAgICAgICAgICAgICAgICAgICAgYnJlYWs7ICAvLyDkuIDml6bljLnphY3miJDlip/vvIzot7PliLAgQWxpY2Ug55qE5LiL5LiA5Liq5Ye65ouzCiAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgIH0KICAgICAgICB9CgogICAgICAgIC8vIOi+k+WHuuW9k+WJjea1i+ivleeUqOS+i+eahCBBbGljZSDojrfog5znmoTmrKHmlbAKICAgICAgICBjb3V0IDw8IHdpbl9jb3VudCA8PCBlbmRsOwogICAgfQoKICAgIHJldHVybiAwOwp9Cg==

Mwo1CjAxMjAxCjIyMQozCjIyMgozMDAKNAowMTIyCjExMg==

3
5
01201
221
3
222
300
4
0122
112