hdu 6380

#include<bits/stdc++.h>
#define in(a) scanf("%d",&a)
using namespace std;

struct nod
{
    int v,next;
}side[405555];

int head[200005],cnt,index,fri[200005];

void add(int u,int v)
{
    side[cnt].v=v;
    side[cnt].next=head[u];
    head[u]=cnt++;
    fri[u]++;

}

int scc[200005],dfn[200005],low[2000005],ins[200005],vis[200005],stac[200005],tail;

void tarjan(int cur)
{
    dfn[cur]=low[cur]=index++;
    ins[cur]=1;
    vis[cur]=1;
    stac[tail++]=cur;
    for(int i=head[cur];i!=-1;i=side[i].next)
    {
        int c=side[i].v;
        if(!vis[c])
        {
            tarjan(c);
            low[cur]=min(low[cur],low[c]);
        }
        else if(ins[c])
            low[cur]=min(low[cur],dfn[c]);
    }
    if(dfn[cur]==low[cur])
    {
        cnt++;
        int v;
        do
        {
            v=stac[tail-1];
            scc[v]=cnt;
            ins[v]=0;
            tail--;
        }while(v!=cur);
    }
}

int main()
{
    int N;
    in(N);
    while(N--)
    {
        memset(head,-1,sizeof(head));
        memset(ins,0,sizeof(ins));
        memset(vis,0,sizeof(vis));
        memset(fri,0,sizeof(fri));
        int n,m,k,x,y;
        in(n);in(m);in(k);
        cnt=0;
        for(int i=0;i<m;i++)
        {
            in(x);in(y);
            add(x,y);add(y,x);
        }
        index=0;tail=0;cnt=0;
        int maxn=0;
        for(int i=0;i<n;i++)
            {
                if(!vis[i])
                tarjan(i);
                maxn=max(maxn,fri[i]);
            }
        if(maxn+cnt-1+k>n-1)
            printf("%d
",n-1);
        else
            printf("%d
",maxn+cnt-1+k);


    }
    return 0;
}