#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
const int INF = 2000000000;
struct Edge {
  int from, to, cap, flow, index;
  Edge(int from, int to, int cap, int flow, int index)
      : from(from), to(to), cap(cap), flow(flow), index(index) {}
};
struct Dinic {
  int N;
  vector<vector<Edge>> G;
  vector<Edge *> dad;
  vector<int> Q;
  Dinic(int N) : N(N), G(N), dad(N), Q(N) {}
  void AddEdge(int from, int to, int cap) {
    G[from].push_back(Edge(from, to, cap, 0, G[to].size()));
    if (from == to) G[from].back().index++;
    G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1));
  }
  long long BlockingFlow(int s, int t) {
    fill(dad.begin(), dad.end(), (Edge *)NULL);
    dad[s] = &G[0][0] - 1;
    int head = 0, tail = 0;
    Q[tail++] = s;
    while (head < tail) {
      int x = Q[head++];
      for (int i = 0; i < G[x].size(); i++) {
        Edge &e = G[x][i];
        if (!dad[e.to] && e.cap - e.flow > 0) {
          dad[e.to] = &G[x][i];
          Q[tail++] = e.to;
        }
      }
    }
    if (!dad[t]) return 0;
    long long totflow = 0;
    for (int i = 0; i < G[t].size(); i++) {
      Edge *start = &G[G[t][i].to][G[t][i].index];
      int amt = INF;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        if (!e) {
          amt = 0;
          break;
        }
        amt = min(amt, e->cap - e->flow);
      }
      if (amt == 0) continue;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        e->flow += amt;
        G[e->to][e->index].flow -= amt;
      }
      totflow += amt;
    }
    return totflow;
  }
  long long GetMaxFlow(int s, int t) {
    long long totflow = 0;
    while (long long flow = BlockingFlow(s, t)) totflow += flow;
    return totflow;
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, b, q;
  cin >> n >> b >> q;
  vector<pair<int, int>> v(q);
  for (int i = 0; i < q; i++) cin >> v[i].first >> v[i].second;
  v.push_back({0, 0});
  v.push_back({b, n});
  sort(v.begin(), v.end());
  v.resize(distance(v.begin(), unique(v.begin(), v.end())));
  for (int i = 1; i < v.size(); i++)
    if (v[i].second < v[i - 1].second ||
        v[i].second - v[i - 1].second > v[i].first - v[i - 1].first) {
      cout << "unfair" << '\n';
      return 0;
    }
  vector<pair<pair<int, int>, int>> rng;
  for (int i = 1; i < v.size(); i++)
    rng.push_back(
        {{v[i - 1].first + 1, v[i].first}, v[i].second - v[i - 1].second});
  Dinic mf(N);
  int src = 1e5 - 10, sink = 1e5 - 9;
  for (int i = 0; i < 5; i++) {
    mf.AddEdge(src, i, n / 5);
    for (int j = 0; j < rng.size(); j++) {
      int cnt = 0;
      for (int k = rng[j].first.first; k <= rng[j].first.second; k++) {
        if (k % 5 != i) continue;
        cnt++;
      }
      if (cnt) mf.AddEdge(i, j + 5, cnt);
    }
  }
  for (int j = 0; j < rng.size(); j++)
    mf.AddEdge(j + 5, j + 5 + rng.size(), rng[j].second),
        mf.AddEdge(j + 5 + rng.size(), sink, INF);
  if (mf.GetMaxFlow(src, sink) == n)
    cout << "fair" << '\n';
  else
    cout << "unfair" << '\n';
  return 0;
}
