#include <bits/stdc++.h>
int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
int main() {
	int n = ri();
	int m = ri();
	int t = ri(); 
	int last_time = 0;
	int cur = n;
	bool res = true;
	for (int i = 0; i <= m; i++) {
		int a = i < m ? ri() : t;
		int b = i < m ? ri() : t;
		cur -= a - last_time;
		if (cur <= 0) res = false;
		cur = std::min(n, cur + b - a);
		last_time = b;
	}
	
	puts(res ? "Yes" : "No");
	return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

int a[100009];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int tc; cin >> tc;
	for (int ti = 0; ti < tc; ti++) {
		int n; cin >> n;
		for (int i = 0; i < n; i++)
			cin >> a[i];	
		if (n % 2 == 1) {
			cout << "Second" << '\n';
			continue;
		}
		sort(a, a + n);
		bool f = true;
		for (int i = 0; i < n; i += 2)
			if (a[i] != a[i + 1]) {
				f = false;
				break;
			}
		if (f) cout << "Second" << '\n';
		else cout << "First" << '\n';
	}
	return 0;
}