#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int inf = 0x3f3f3f3f;
const int N = 1000005, M = 103, mod = 1e9 + 7;
const double eps = 1e-8;
int a[N];
//输一次密码只能取一个快递,除了最靠近出口的快递,其他的先后顺序对结果不影响
//最小的快递如果小于k,则可以在回到入口的过程取走,否则需要单独取一次
//注意入口的位置是1
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
int maxm = inf;
for (int i = 0; i < m; i++)
{
scanf("%d", &a[i]);
maxm = min(maxm, a[i]);
}
//sort(a, a + m);
ll res = 2*(k-1);
for (int i = 0; i < m; i++)
res += 2 * (abs(k - a[i]));
if (maxm < k)
res -= 2 * (abs(k - maxm));
printf("%lld\n",res);
//cout << maxm << endl;
}
return 0;
}