#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 11;
bool mark[MAXN];
map<int, vector<pair<int, int> > > xmap, ymap;
set<int> xsp, ysp;
set<pair<int, int> > xs, ys;
int calc(vector<pair<int, int> > line) {
  vector<pair<int, int> > r;
  for (int i = 0; i < line.size(); i++) {
    r.push_back(make_pair(line[i].first, 0));
    r.push_back(make_pair(line[i].second, 1));
  }
  sort(r.begin(), r.end());
  int ans = 0, cnt = 0, prev = -1;
  for (int i = 0; i < r.size(); i++) {
    if (prev == -1) prev = r[i].first;
    if (cnt > 0) ans += r[i].first - prev;
    if (r[i].second == 0)
      cnt++;
    else
      cnt--;
    prev = r[i].first;
  }
  return ans;
}
pair<int, int> move(vector<pair<int, int> > line, int len) {
  if (line.size() == 0) return make_pair(0, len);
  vector<pair<int, int> > r;
  for (int i = 0; i < line.size(); i++) {
    r.push_back(make_pair(line[i].first, 1));
    r.push_back(make_pair(line[i].second, 0));
  }
  sort(r.begin(), r.end());
  int ans = 0, cnt = 0, prev = 0, help = 0;
  for (int i = 0; i < r.size(); i++) {
    if (cnt >= 0) ans += r[i].first - prev;
    if (ans >= len) {
      return make_pair(0, r[i].first - (ans - len));
    }
    if (r[i].second == 0)
      cnt++;
    else
      cnt--;
    prev = r[i].first;
    help = r[i].first;
  }
  return make_pair(0, help + (len - ans));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= k; i++) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      xmap[x1].push_back(make_pair(min(y1, y2), max(y1, y2)));
      xsp.insert(x1);
    } else {
      ymap[y1].push_back(make_pair(min(x1, x2), max(x1, x2)));
      ysp.insert(y1);
    }
  }
  long long ans = 0;
  for (auto it = xmap.begin(); it != xmap.end(); it++) {
    int a = m - calc((*it).second);
    ans ^= a;
    xs.insert(make_pair((*it).first, a));
  }
  for (auto it = ymap.begin(); it != ymap.end(); it++) {
    int a = n - calc((*it).second);
    ans ^= a;
    ys.insert(make_pair((*it).first, a));
  }
  ans ^= ((n - xmap.size() - 1) % 2 == 0 ? 0 : m);
  ans ^= ((m - ymap.size() - 1) % 2 == 0 ? 0 : n);
  for (int i = 1; i <= n - 1; i++)
    if (xsp.find(i) == xsp.end()) {
      xs.insert(make_pair(i, m));
      break;
    }
  for (int i = 1; i <= m - 1; i++)
    if (ysp.find(i) == ysp.end()) {
      ys.insert(make_pair(i, n));
      break;
    }
  if (ans == 0) {
    cout << "SECOND" << endl;
    return 0;
  } else {
    cout << "FIRST" << endl;
    int bit = -1;
    for (int i = 40; i >= 0 and bit < 0; i--)
      if ((ans >> i) & 1) bit = i;
    for (auto it = xs.begin(); it != xs.end(); it++) {
      int a = (*it).first, b = (*it).second;
      if ((b >> bit) & 1) {
        int c = b;
        for (int j = 0; j <= bit; j++)
          if ((ans >> j) & 1)
            if ((c >> j) & 1)
              c -= (1 << j);
            else
              c += (1 << j);
        pair<int, int> ANS = move(xmap[a], b - c);
        cout << a << " " << ANS.first << " " << a << " " << ANS.second << endl;
        return 0;
      }
    }
    for (auto it = ys.begin(); it != ys.end(); it++) {
      int a = (*it).first, b = (*it).second;
      if ((b >> bit) & 1) {
        int c = b;
        for (int j = 0; j <= bit; j++)
          if ((ans >> j) & 1)
            if ((c >> j) & 1)
              c -= (1 << j);
            else
              c += (1 << j);
        pair<int, int> ANS = move(ymap[a], b - c);
        cout << ANS.first << " " << a << " " << ANS.second << " " << a << endl;
        return 0;
      }
    }
  }
  return 0;
}
