#include<bits/stdc++.h>
#define int long long
using namespace std;

int mem[1000][1000][100];
int getsg2(int l,int r,int x){
    if(mem[l][r][x] != -1)return mem[l][r][x];
    if(r<l)return 0;
    set<int> s;
    for(int i=r;(i)*x>=r ;i--){
        s.insert(getsg2(l,i-1,x));
    }
    int v = 0;
    while(s.count(v))v++;
    return mem[l][r][x] = v;
}

int getsg(int l,int r,int x){
    // cerr<<l<<' '<<r<<' '<<x<<endl;
    while(r%x == 1 && (r-1)/x>=l)r = (r-1)/x-1;
    if(r<l)return 0;
    // cerr<<r<<endl;
    if(r<=x*l)return r-l+1;
    // cout<<' '<<l<<' '<<r<<' '<<x<<endl;
    return r-l-((r+x-1)/x-l)+1;
}
void solve(){
    int n,x;
    cin>>n>>x;
    int sg = 0;
    for(int i=0;i<n;i++){
        int l,r;
        cin>>l>>r;
        sg ^= getsg(l,r,x);
    }
    if(sg){
        cout<<"First"<<endl;
    }
    else {
        cout<<"Second"<<endl;
    }
}

signed main(){
    // cout<<"Here"<<endl;
    // memset(mem, -1,sizeof(mem));
    // for(int x = 2;x<100;x++)
    // for(int l=1;l<1000;l++)
    // for(int r=l+1;r<1000;r++){
    //     int sg = getsg(l,r,x);
    //     if(sg != getsg2(l,r,x))
    //         cout<<l<<' '<<r<<' '<<x<<' '<<getsg2(l,r,x)<<' '<<sg<<endl;

    // }
    int T;
    cin>>T;
    while (T--)
    {
        solve();
    }
    
}


/**
 * 
4
1 3
1 6
4 100
1 10
2 16
1 7
12 13
3 5
1 8
20 20
13 18
3 2
1 10
2 9
3 4
 * 
 */
/*
0 0
1 0
2 0
3 0
4 0
5 1
6 2
7 3
8 4
9 5
10 6
11 7
12 8
13 0
14 9
15 10
16 1
17 11
18 12
19 2
20 13
21 14
22 3
23 15
24 16
25 4
26 17
27 18
28 5
29 19
30 20
31 6
32 21
33 22
34 7
35 23
36 24
37 8
38 25
39 26
40 0
41 27
42 28
43 9
44 29
45 30
46 10
47 31
48 32
49 1
*/