#include <bits/stdc++.h>
using namespace std;
const int K = 100010;
int n[2], k;
map<int, vector<pair<int, int> > > mp[2];
map<int, int> mpc;
int solve(vector<pair<int, int> >& p, int tot, int i) {
  sort(p.begin(), p.end());
  int c = 0, py = 0;
  for (int j = 0; j < (int(p.size())); ++j) {
    if (p[j].second > py) {
      c += p[j].second - max(py, p[j].first);
      py = p[j].second;
    }
  }
  return mpc[i] = (tot - c);
}
int main() {
  while (scanf("%d%d%d", &n[0], &n[1], &k) == 3) {
    for (int i = 0; i < (2); ++i) mp[i].clear();
    int x1, x2, y1, y2;
    while (k--) {
      scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
      if (x1 == x2)
        mp[0][x1].push_back(pair<int, int>(min(y1, y2), max(y1, y2)));
      else
        mp[1][y1].push_back(pair<int, int>(min(x1, x2), max(x1, x2)));
    }
    for (int i = 0; i < (2); ++i) {
      if ((n[i] - 1 - (int)mp[i].size()) & 1)
        for (int j = 1; j <= (n[i] - 1); ++j)
          if (mp[i].find(j) == mp[i].end()) {
            mp[i][j].push_back(pair<int, int>(0, 0));
            break;
          }
    }
    mpc.clear();
    int ans = 0;
    for (int i = 0; i < (2); ++i)
      for (map<int, vector<pair<int, int> > >::iterator it = mp[i].begin();
           it != mp[i].end(); ++it) {
        ans ^= solve(it->second, n[i ^ 1], it->first + n[0] * i);
      }
    if (ans) {
      puts("FIRST");
      for (map<int, int>::iterator it = mpc.begin(); it != mpc.end(); ++it) {
        if ((it->second ^ ans) <= it->second) {
          int d = it->second - (it->second ^ ans);
          int i = 0, j = it->first;
          if (j > n[0]) i = 1, j -= n[0];
          vector<pair<int, int> >& p = mp[i][j];
          int py = 0;
          for (int k = 0; k < (int(p.size())); ++k) {
            if (p[k].first > py) {
              if (p[k].first - py >= d)
                break;
              else
                d -= p[k].first - py;
            }
            if (py < p[k].second) py = p[k].second;
          }
          py += d;
          if (i == 0)
            printf("%d %d %d %d\n", j, 0, j, py);
          else
            printf("%d %d %d %d\n", 0, j, py, j);
          break;
        }
      }
    } else
      puts("SECOND");
  }
  return 0;
}
