# pragma GCC optimize(3)
# include <bits/stdc++.h>
# define int long long
using namespace std;
int n,m,q;
inline int read()
{int X=0,w=0; char c=0;while(c<'0'||c>'9') {w|=c=='-';c=getchar();}while(c>='0'&&c<='9') X=(X<<3)+(X<<1)+(c^48),c=getchar();return w?-X:X;
}
int calc(int i,int x){if (x%i==0) return min(x/i-1,m);else return min(x/i,m);
}
bool check(int x,int k)
{int ret=0;for (int l=1,r;l<=min(x,m);l=r+1) {r=x/(x/l);ret+=min((x/l),n)*(r-l+1);} return (ret>=k);
}
signed main()
{n=read();m=read();q=read();while (q--) {int x=read(); int l=1,r=n,ans;while (l<=r) {int mid=(l+r)>>1;if (check(mid,x)) ans=mid,r=mid-1;else l=mid+1;}printf("%lld\n",ans);}return 0;
}

# pragma GCC optimize(3)
# include <bits/stdc++.h>
using namespace std;
const int N=4e3+10;
int n,m,f[N];
struct node{ int u,v,w;}E[N];
bool cmp(node a,node b) {return a.w<b.w;}
inline int read()
{int X=0,w=0; char c=0;while(c<'0'||c>'9') {w|=c=='-';c=getchar();}while(c>='0'&&c<='9') X=(X<<3)+(X<<1)+(c^48),c=getchar();return w?-X:X;
}
int father(int x) {if (f[x]==x) return x;return f[x]=father(f[x]);
}
int MST(int W)
{for (int i=1;i<=n;i++) f[i]=i;int tmp=0,o=0;for (int i=1;i<=m;i++) {if (E[i].w<W) continue;int fx=father(E[i].u),fy=father(E[i].v);if (fx==fy) continue;tmp++; f[fx]=fy; o=max(o,E[i].w);if (tmp==n-1) break;}if (tmp!=n-1) return -1;else return o;
}
int main()
{int T=read();while (T--) {n=read();m=read();for (int i=1;i<=m;i++) {int u=read(),v=read(),w=read(); E[i]=(node){u,v,w};}sort(E+1,E+1+m,cmp);int ans=-1;for (int i=1;i<=m;i++) {int t=MST(E[i].w);if (t==-1) continue;if (ans==-1) ans=t-E[i].w;else ans=min(ans,t-E[i].w);}printf("%d\n",ans);}return 0;
}

# pragma GCC optimize(3)
# include <bits/stdc++.h>
# define int long long
using namespace std;
const int mo=1e9+7;
int f[2][205][1005];
int a[205];
int n,w;
signed main()
{scanf("%lld%lld",&n,&w);for (int i=1;i<=n;i++) scanf("%lld",&a[i]);sort(a+1,a+1+n);int p=0; f[p][0][0]=1; for (int i=1;i<=n;i++) {p^=1; memset(f[p],0,sizeof(f[p]));for (int j=0;j<=i;j++)for (int k=0;k<=w;k++) {int v=(a[i]-a[i-1])*j+k;if (v>w) continue;f[p][j+1][v]+=f[p^1][j][k]; f[p][j+1][v]%=mo;f[p][j][v]+=f[p^1][j][k];f[p][j][v]%=mo;if (j) {f[p][j][v]+=f[p^1][j][k]*j; f[p][j][v]%=mo;f[p][j-1][v]+=f[p^1][j][k]*j;f[p][j-1][v]%=mo;} }   }int ret=0;for (int k=0;k<=w;k++)ret+=f[p][0][k],ret%=mo;printf("%lld\n",ret);   return 0;
}