#include <bits/stdc++.h>
using namespace std;
map<int, vector<pair<int, int> > > x;
map<int, vector<pair<int, int> > > y;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < k; i++) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    if (b == d) {
      if (a > c) swap(a, c);
      y[b].push_back(make_pair(a, c));
    } else if (a == c) {
      if (b > d) swap(b, d);
      x[a].push_back(make_pair(b, d));
    }
  }
  int num_pile, ans = 0;
  num_pile = n - 1;
  for (auto i = x.begin(); i != x.end(); i++) {
    sort(i->second.begin(), i->second.end());
    int tmp = 0, num = 0;
    for (int j = 0; j < i->second.size(); j++) {
      int s1 = i->second[j].first;
      int s2 = i->second[j].second;
      if (s2 < tmp) {
      } else if (s1 < tmp) {
        num += (s2 - tmp);
        tmp = s2;
      } else {
        num += (s2 - s1);
        tmp = s2;
      }
    }
    ans = ans ^ (m - num);
    num_pile--;
  }
  if (num_pile % 2) ans ^= m;
  num_pile = m - 1;
  for (auto i = y.begin(); i != y.end(); i++) {
    sort(i->second.begin(), i->second.end());
    int tmp = 0, num = 0;
    for (int j = 0; j < i->second.size(); j++) {
      int s1 = i->second[j].first;
      int s2 = i->second[j].second;
      if (s2 < tmp) {
      } else if (s1 < tmp) {
        num += (s2 - tmp);
        tmp = s2;
      } else {
        num += (s2 - s1);
        tmp = s2;
      }
    }
    ans = ans ^ (n - num);
    num_pile--;
  }
  if (num_pile % 2) ans ^= n;
  if (ans == 0)
    puts("SECOND");
  else {
    puts("FIRST");
    for (auto i = x.begin(); i != x.end(); i++) {
      int tmp = 0, num = 0;
      for (int j = 0; j < i->second.size(); j++) {
        int s1 = i->second[j].first;
        int s2 = i->second[j].second;
        if (s2 < tmp) {
        } else if (s1 < tmp) {
          num += (s2 - tmp);
          tmp = s2;
        } else {
          num += (s2 - s1);
          tmp = s2;
        }
      }
      int sz = m - num;
      if ((ans ^ sz) < sz) {
        int num2 = sz - (ans ^ sz);
        tmp = 0;
        for (int j = 0; j < i->second.size(); j++) {
          int s1 = i->second[j].first;
          int s2 = i->second[j].second;
          if (s2 < tmp) {
          } else if (s1 < tmp) {
            tmp = s2;
          } else {
            if (s1 - tmp >= num2) {
              cout << i->first << " " << 0 << " " << i->first << " "
                   << tmp + num2 << endl;
              return 0;
            } else {
              num2 -= (s1 - tmp);
            }
            tmp = s2;
          }
        }
        if (m - tmp >= num2) {
          cout << i->first << " " << 0 << " " << i->first << " " << tmp + num2
               << endl;
          return 0;
        }
      }
    }
    for (auto i = y.begin(); i != y.end(); i++) {
      int tmp = 0, num = 0;
      for (int j = 0; j < i->second.size(); j++) {
        int s1 = i->second[j].first;
        int s2 = i->second[j].second;
        if (s2 < tmp) {
        } else if (s1 < tmp) {
          num += (s2 - tmp);
          tmp = s2;
        } else {
          num += (s2 - s1);
          tmp = s2;
        }
      }
      int sz = n - num;
      if ((ans ^ sz) < sz) {
        int num2 = sz - (ans ^ sz);
        tmp = 0;
        for (int j = 0; j < i->second.size(); j++) {
          int s1 = i->second[j].first;
          int s2 = i->second[j].second;
          if (s2 < tmp) {
          } else if (s1 < tmp) {
            tmp = s2;
          } else {
            if (s1 - tmp >= num2) {
              cout << 0 << " " << i->first << " " << tmp + num2 << " "
                   << i->first << endl;
              return 0;
            } else {
              num2 -= (s1 - tmp);
            }
            tmp = s2;
          }
        }
        if (n - tmp >= num2) {
          cout << 0 << " " << i->first << " " << tmp + num2 << " " << i->first
               << endl;
          return 0;
        }
      }
    }
    if ((ans ^ m) < m) {
      for (int i = 1; i < n; i++)
        if (x.count(i) == 0) {
          cout << i << " " << 0 << " " << i << " " << (m - (ans ^ m)) << endl;
          return 0;
        }
    } else if ((ans ^ n) < n) {
      for (int j = 1; j < m; j++)
        if (y.count(j) == 0) {
          cout << 0 << " " << j << " " << (n - (ans ^ n)) << " " << j << endl;
          return 0;
        }
    }
  }
  return 0;
}
