FerryLoadingII

#include <bits/stdc++.h>

using namespace std;

#define debug(a) cout << #a << ": " << a << endl
#define fto(i, l, r) for(int i = (l); i <= (r); ++i)
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define forit(it, var) for(__typeof(var.begin()) it = var.begin(); it != var.end(); it++)
#define forrit(rit, var) for(__typeof(var.rbegin()) rit = var.rbegin(); rit != var.rend(); rit++)
#define ii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define ull unsigned long long
#define maxN 2005
#define oo 1000000007

int main() {
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        //freopen("output.txt", "w", stdout);
    #endif // ONLINE_JUDGE

    int nTest;
    scanf("%d", &nTest);
    fto(iTest, 1, nTest) {
        vector<int> a(maxN);
        int n, t, m;
        scanf("%d%d%d", &n, &t, &m);
        fto(i, 0, m-1) scanf("%d", &a[i]);
        int p = (m+n-1)%n, ans = 0;
        for(; p < m; p += n) ans = max(ans, a[p]) + 2*t;
        printf("%d %d\n", ans-t, (m+n-1)/n);
    }

    return 0;
}