#include <bits/stdc++.h>
using namespace std;
void fun(const vector<pair<int, int> >& v, int m, vector<pair<int, int> >& u) {
  int n = v.size();
  map<int, int> mp;
  for (int i = 0; i < n; ++i) {
    ++mp[v[i].first];
    --mp[v[i].second];
  }
  int p0 = 0, q = 0;
  for (map<int, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
    if (it->second == 0) continue;
    if (q == 0 and it->first != 0) u.push_back(pair<int, int>(p0, it->first));
    q += it->second;
    if (q == 0) p0 = it->first;
  }
  if (p0 != m) u.push_back(pair<int, int>(p0, m));
}
int cut(const vector<pair<int, int> >& v, int q) {
  int t = 0;
  for (int i = 0; i < int(v.size()); ++i) {
    if (t + v[i].second - v[i].first >= q) return v[i].first + q - t;
    t += v[i].second - v[i].first;
  }
  return -1;
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  map<int, vector<pair<int, int> > > rows, cols;
  for (int i = 0; i < k; ++i) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2)
      rows[x1].push_back(pair<int, int>(min(y1, y2), max(y1, y2)));
    else
      cols[y1].push_back(pair<int, int>(min(x1, x2), max(x1, x2)));
  }
  int nim = 0;
  if ((n - 1 - rows.size()) % 2 != 0) nim ^= m;
  if ((m - 1 - cols.size()) % 2 != 0) nim ^= n;
  for (map<int, vector<pair<int, int> > >::iterator it = rows.begin();
       it != rows.end(); ++it) {
    vector<pair<int, int> > v;
    fun(it->second, m, v);
    int s = 0;
    for (int i = 0; i < int(v.size()); ++i) s += v[i].second - v[i].first;
    nim ^= s;
  }
  for (map<int, vector<pair<int, int> > >::iterator it = cols.begin();
       it != cols.end(); ++it) {
    vector<pair<int, int> > v;
    fun(it->second, n, v);
    int s = 0;
    for (int i = 0; i < int(v.size()); ++i) s += v[i].second - v[i].first;
    nim ^= s;
  }
  if (nim == 0) {
    cout << "SECOND" << endl;
    return 0;
  }
  cout << "FIRST" << endl;
  if (n - 1 - rows.size() > 0) {
    int t = m - (nim ^ m);
    if (t > 0) {
      int x = 1;
      while (rows.count(x)) ++x;
      cout << x << " 0 " << x << " " << t << endl;
      return 0;
    }
  }
  if (m - 1 - cols.size() > 0) {
    int t = n - (nim ^ n);
    if (t > 0) {
      int y = 1;
      while (cols.count(y)) ++y;
      cout << "0 " << y << " " << t << " " << y << endl;
      return 0;
    }
  }
  for (map<int, vector<pair<int, int> > >::iterator it = rows.begin();
       it != rows.end(); ++it) {
    vector<pair<int, int> > v;
    fun(it->second, m, v);
    int s = 0;
    for (int i = 0; i < int(v.size()); ++i) s += v[i].second - v[i].first;
    int t = s - (nim ^ s);
    if (t > 0) {
      int y = cut(v, t);
      if (y != -1) {
        cout << it->first << " 0 " << it->first << " " << y << endl;
        return 0;
      }
    }
  }
  for (map<int, vector<pair<int, int> > >::iterator it = cols.begin();
       it != cols.end(); ++it) {
    vector<pair<int, int> > v;
    fun(it->second, n, v);
    int s = 0;
    for (int i = 0; i < int(v.size()); ++i) s += v[i].second - v[i].first;
    int t = s - (nim ^ s);
    if (t > 0) {
      int x = cut(v, t);
      if (x != -1) {
        cout << "0 " << it->first << " " << x << " " << it->first << endl;
        return 0;
      }
    }
  }
}
