#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<assert.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

void unionInit(int d[],int s){int i;rep(i,s)d[i]=i;}
int unionGet(int d[],int n){int t=n,k;while(d[t]!=t)t=d[t];while(d[n]!=n)k=d[n],d[n]=t,n=k;return n;}
int unionConnect(int d[],int a,int b){a=unionGet(d,a);b=unionGet(d,b);if(a==b)return 0;d[a]=b;return 1;}


/* odd:    the number of components made of odd number of nodes, which have no magicians */
/* even:   the number of components made of even number of nodes, which have no magicians */
/* edge:   the number of edge which can be added without connected any two components mod 2 (if edge = 1, then the current magician can use pass) */
/* target: if 1, corrent magician want to make 2 odd components, otherwisem he want to make 2 even components */
/* myT:    the number of teleportation for current magician */
/* opT:    the number of teleportation for opponent magician */
/* myP:    the size of component which has current magician mod 2 */
/* opP:    the size of component which has opponent magician mod 2 */
int dp[20][20][2][2][20][20][2][2];
int solve(int odd, int even, int edge, int target, int myT, int opT, int myP, int opP){
  int res = 0;
  int nedge, nP;

  if(dp[odd][even][edge][target][myT][opT][myP][opP] >= 0) return dp[odd][even][edge][target][myT][opT][myP][opP];

  if(odd + even == 0){
    if(myP == target) res = 1;
    assert(myP == opP);
    return dp[odd][even][edge][target][myT][opT][myP][opP] = res;
  }

  if(edge)
    res |= 1-solve(odd, even, edge^1, target^1, opT, myT, opP, myP);
  
  if(odd >= 2)
    res |= 1-solve(odd-2, even+1, edge, target^1, opT, myT, opP, myP);

  if(odd >= 2 && myT > 0 && myP == 1 && even+1 > 0)
    res |= 1-solve(odd-2+1, even+1-1, edge, target^1, opT, myT-1, opP, myP^1);

  if(odd >= 2 && myT > 0 && myP == 0 && odd-2 > 0)
    res |= 1-solve(odd-2-1, even+1+1, edge, target^1, opT, myT-1, opP, myP^1);

  if(odd >= 1 && even >= 1)
    res |= 1-solve(odd, even-1, edge^1, target^1, opT, myT, opP, myP);

  if(odd >= 1 && even >= 1 && myT > 0 && myP == 1 && even-1 > 0)
    res |= 1-solve(odd+1, even-1-1, edge^1, target^1, opT, myT-1, opP, myP^1);

  if(odd >= 1 && even >= 1 && myT > 0 && myP == 0 && odd > 0)
    res |= 1-solve(odd-1, even-1+1, edge^1, target^1, opT, myT-1, opP, myP^1);

  if(even >= 2)
    res |= 1-solve(odd, even-1, edge, target^1, opT, myT, opP, myP);

  if(even >= 2 && myT > 0 && myP == 1 && even-1 > 0)
    res |= 1-solve(odd+1, even-1-1, edge^1, target^1, opT, myT-1, opP, myP^1);

  if(even >= 2 && myT > 0 && myP == 0 && odd > 0)
    res |= 1-solve(odd-1, even-1+1, edge^1, target^1, opT, myT-1, opP, myP^1);

  if(even >= 1)
    res |= 1-solve(odd, even-1, edge^1, target^1, opT, myT, opP, myP);

  if(even >= 1 && myT > 0 && myP == 1 && even-1 > 0)
    res |= 1-solve(odd+1, even-1-1, edge^1, target^1, opT, myT-1, opP, myP^1);

  if(even >= 1 && myT > 0 && myP == 0 && odd > 0)
    res |= 1-solve(odd-1, even-1+1, edge^1, target^1, opT, myT-1, opP, myP^1);

  if(odd >= 1 && myP == 0)
    res |= 1-solve(odd-1, even, edge^1, target^1, opT, myT, opP, myP^1);

  if(odd >= 1 && myP == 1)
    res |= 1-solve(odd-1, even, edge  , target^1, opT, myT, opP, myP^1);

  if(odd >= 1 && myP == 0 && myT > 0 && even > 0)
    res |= 1-solve(odd-1+1, even-1, edge^1, target^1, opT, myT-1, opP, myP);

  if(odd >= 1 && myP == 1 && myT > 0 && odd-1 > 0)
    res |= 1-solve(odd-1-1, even+1, edge  , target^1, opT, myT-1, opP, myP);

  if(odd >= 1 && opP == 0)
    res |= 1-solve(odd-1, even, edge^1, target^1, opT, myT, opP^1, myP);

  if(odd >= 1 && opP == 1)
    res |= 1-solve(odd-1, even, edge  , target^1, opT, myT, opP^1, myP);

  if(odd >= 1 && opP == 0 && myT > 0 && myP == 0 && odd-1 > 0)
    res |= 1-solve(odd-1-1, even+1, edge^1, target^1, opT, myT-1, opP^1, myP^1);

  if(odd >= 1 && opP == 1 && myT > 0 && myP == 0 && odd-1 > 0)
    res |= 1-solve(odd-1-1, even+1, edge  , target^1, opT, myT-1, opP^1, myP^1);

  if(odd >= 1 && opP == 0 && myT > 0 && myP == 1 && even > 0)
    res |= 1-solve(odd-1+1, even-1, edge^1, target^1, opT, myT-1, opP^1, myP^1);

  if(odd >= 1 && opP == 1 && myT > 0 && myP == 1 && even > 0)
    res |= 1-solve(odd-1+1, even-1, edge  , target^1, opT, myT-1, opP^1, myP^1);

  if(myT > 0 && myP == 0 && opP == 0 && odd > 0)
    res |= 1-solve(odd-1, even, edge^1, target^1, opT, myT-1, 0, 1);

  if(myT > 0 && myP == 0 && opP == 1 && odd > 0)
    res |= 1-solve(odd-1, even, edge^1, target^1, opT, myT-1, 1, 1);

  if(myT > 0 && myP == 1 && opP == 0 && odd > 0)
    res |= 1-solve(odd-1, even, edge^1, target^1, opT, myT-1, 1, 1);

  if(myT > 0 && myP == 1 && opP == 1 && odd > 0)
    res |= 1-solve(odd-1, even, edge  , target^1, opT, myT-1, 0, 1);

  if(myT > 0 && myP == 0 && opP == 0 && even > 0)
    res |= 1-solve(odd, even-1, edge^1, target^1, opT, myT-1, 0, 0);

  if(myT > 0 && myP == 0 && opP == 1 && even > 0)
    res |= 1-solve(odd, even-1, edge^1, target^1, opT, myT-1, 1, 0);

  if(myT > 0 && myP == 1 && opP == 0 && even > 0)
    res |= 1-solve(odd, even-1, edge^1, target^1, opT, myT-1, 1, 0);

  if(myT > 0 && myP == 1 && opP == 1 && even > 0)
    res |= 1-solve(odd, even-1, edge  , target^1, opT, myT-1, 0, 0);

  return dp[odd][even][edge][target][myT][opT][myP][opP] = res;
}


int main(){
  int i,j,k,l,m,n,a,b;
  int T, N, M, P, X[20100], Y[20100];
  int odd, even, ind[10010], s[10010], first, second, tar;

  rep(i,20) rep(j,20) rep(k,2) rep(l,2) rep(m,20) rep(n,20) rep(a,2) rep(b,2) dp[i][j][k][l][m][n][a][b] = -1;

  /*
  rep(i,20) rep(j,20) if(i+j < 18) rep(k,2) rep(l,2) rep(m,20) if(m<19) rep(a,2) rep(b,2){
    if((i+a+b)%2) continue;
    if( solve(i+2,j,k,l,m,m,a,b) != solve(i,j,k,l,m,m,a,b) ) printf("A %d %d %d %d %d %d %d %d\n",i,j,k,l,m,m,a,b);
    if( solve(i,j+2,k,l,m,m,a,b) != solve(i,j,k,l,m,m,a,b) ) printf("B %d %d %d %d %d %d %d %d\n",i,j,k,l,m,m,a,b);
    if( solve(i,j,k,l,m,m,a,b) != solve(i,j,k,l,m+1,m+1,a,b) ) printf("C %d %d %d %d %d %d %d %d\n",i,j,k,l,m,m,a,b);
  }
  return 0;
  */

  assert( scanf("%d",&T)==1 );
  assert( 0<=T && T<=100 );
  while(T--){
    assert( scanf("%d%d%d",&N,&M,&P)==3 );
    assert( 2<=N&&N<=7777&&0<=M&&M<=10000&&0<=P&&P<=10000 );
    rep(i,M) assert( scanf("%d%d",X+i,Y+i) ), X[i]--, Y[i]--;

    if(0){
      rep(i,M){
        if(X[i] > Y[i]) k=X[i], X[i]=Y[i], Y[i]=k;
        assert( 0<=X[i] && X[i]<Y[i] && Y[i]<N );
        rep(j,i) assert( X[i]!=X[j] || Y[i]!=Y[j] );
      }
    }

    unionInit(ind, N); k=0;
    rep(i,M) k += unionConnect(ind, X[i], Y[i]);
    if(unionGet(ind,0)==unionGet(ind,1)){ /* both magicians are in the same component */
      puts("First"); continue;
    }

    rep(i,N) s[i] = 0;
    rep(i,N) s[unionGet(ind,i)]++;

    odd = even = 0; l = 0;
    rep(i,N) if(s[i]){
      if(s[i]%2==0) even++;
      else          odd++;
      l += s[i]*(s[i]-1)/2;
    }

    first  = s[unionGet(ind,0)]%2;
    second = s[unionGet(ind,1)]%2;

    if(N%4 == 1 || N%4 == 3){
      k = M;
      if(N%4==3) k++;
      if(k%2==1) puts("First"); else puts("Second");
      continue;
    }

    if(first ==0) even--; else odd--;
    if(second==0) even--; else odd--;

    l = (l-M)%2; if(l<0) l+=2;
    tar = (M+N/2+1)%2;

    if(P > 1) P = 1;
    if(odd  > 10) odd  = 8 + (odd  % 2);
    if(even > 10) even = 8 + (even % 2);

    k = solve(odd, even, l, tar, P, P, first, second);
    
    if(k) puts("First"); else puts("Second");
  }

  return 0;
}