#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <random>
#include <ctime>
#include <chrono>
#include <numeric>
#include <iomanip>
#include <cassert>

typedef long long ll;
typedef double lf;
typedef unsigned long long ull;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e4 + 210, MAXM = 5e5 + 10, mod = 998244353;
const ll INF = 1e18;

int n, m, K, c[110];
int hp[MAXM], amr[MAXM];
int a[MAXN], mxp[MAXN];

ll f[MAXN][110], g[MAXN][110];

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int T;
    Read(T);
    while (T--)
    {
        Read(n), Read(m);
        for (int i = 0; i <= m; i++) a[i] = 0;
        for (int i = 1; i <= n; i++) Read(hp[i]);
        for (int i = 1; i <= n; i++) Read(amr[i]), a[amr[i]] = max(a[amr[i]], hp[i]);
        Read(K);
        for (int i = 1; i <= K; i++) Read(c[i]);
        int M = 2 * m + 2 * K;
        for (int i = m + 1; i <= M; i++) a[i] = 0;
        for (int i = M - 1; i >= 0; i--) a[i] = max(a[i], a[i + 1]);
        for (int i = 1; i <= M; i++) mxp[i] = max(mxp[i - 1], a[i] + i);
        for (int i = 0; i <= M; i++)
            for (int j = 0; j <= K; j++)
                f[i][j] = INF, g[i][j] = 0;
        f[0][0] = 0, g[0][0] = 1;
        for (int i = 0; i < M; i++)
            for (int j = 0; j <= K; j++)
            {
                if (f[i][j] == INF) continue;
                for (int k = i + 1; k <= M && k <= i + K; k++)
                {
                    int t = max(mxp[i] + j, a[i + 1] + k) - mxp[k];
                    assert(t >= 0), assert(t <= K);
                    if (f[k][t] > f[i][j] + c[k - i]) f[k][t] = f[i][j] + c[k - i], g[k][t] = g[i][j];
                    else if (f[k][t] == f[i][j] + c[k - i]) g[k][t] = (g[k][t] + g[i][j]) % mod;
                }
            }
        ll ans = INF, res = 0;
        for (int i = m; i <= M; i++)
            for (int j = 0; j <= K; j++)
            {
                if (mxp[i] + j > i) continue;
                if (ans > f[i][j]) ans = f[i][j], res = g[i][j];
                else if (ans == f[i][j]) res = (res + g[i][j]) % mod;
            }
        cout << ans << ' ' << (res % mod + mod) % mod << "\n";
    }
    return 0;
}