#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int T;
int a[maxn];
void solve()
{
	int n,m,k;
	cin>>n>>m>>k;
	for(int i=1;i<=m;++i)
	    cin>>a[i];
	a[m+1]=n;
	a[0]=1;
	int sum=m;
	if(a[1]!=1) sum+=(a[1]-2)/k+1;
	for(int i=1;i<=m;++i)
		sum+=(a[i+1]-a[i]-1)/k;
	int t=0,ans=191981145;
	for(int i=1;i<=m;++i){
		if(a[i]==1) continue;
		int f;
		f=sum-(a[i]-a[i-1]-1)/k-(a[i+1]-a[i]-1)/k
		     +(a[i+1]-a[i-1]-1)/k-1;
		if(f<ans){
			t=1;
			ans=f;
		}
		else if(f==ans) t++;
	}
	cout<<ans<<" "<<t<<endl;
}//O(3Tm)
int main()
{
    cin>>T;
    while(T--)
        solve();
	return 0;
}