#include <bits/stdc++.h>
using namespace std;
struct Edge {
  long long int from, to, cap, flow, index;
  Edge(long long int from, long long int to, long long int cap,
       long long int flow, long long int index)
      : from(from), to(to), cap(cap), flow(flow), index(index) {}
};
struct PushRelabel {
  long long int N;
  vector<vector<Edge> > G;
  vector<long long int> excess;
  vector<long long int> dist, active, count;
  queue<int> Q;
  PushRelabel(long long int N)
      : N(N), G(N), excess(N), dist(N), active(N), count(2 * N) {}
  void AddEdge(long long int from, long long int to, long long 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));
  }
  void Enqueue(long long int v) {
    if (!active[v] && excess[v] > 0) {
      active[v] = true;
      Q.push(v);
    }
  }
  void Push(Edge &e) {
    long long int amt = min(excess[e.from], e.cap - e.flow);
    if (dist[e.from] <= dist[e.to] || amt == 0) return;
    e.flow += amt;
    G[e.to][e.index].flow -= amt;
    excess[e.to] += amt;
    excess[e.from] -= amt;
    Enqueue(e.to);
  }
  void Gap(long long int k) {
    for (long long int v = 0; v < N; v++) {
      if (dist[v] < k) continue;
      count[dist[v]]--;
      dist[v] = max(dist[v], N + 1);
      count[dist[v]]++;
      Enqueue(v);
    }
  }
  void Relabel(long long int v) {
    count[dist[v]]--;
    dist[v] = 2 * N;
    for (long long int i = 0; i < G[v].size(); i++)
      if (G[v][i].cap - G[v][i].flow > 0)
        dist[v] = min(dist[v], dist[G[v][i].to] + 1);
    count[dist[v]]++;
    Enqueue(v);
  }
  void Discharge(long long int v) {
    for (long long int i = 0; excess[v] > 0 && i < G[v].size(); i++)
      Push(G[v][i]);
    if (excess[v] > 0) {
      if (count[dist[v]] == 1)
        Gap(dist[v]);
      else
        Relabel(v);
    }
  }
  long long int GetMaxFlow(long long int s, long long int t) {
    count[0] = N - 1;
    count[N] = 1;
    dist[s] = N;
    active[s] = active[t] = true;
    for (long long int i = 0; i < G[s].size(); i++) {
      excess[s] += G[s][i].cap;
      Push(G[s][i]);
    }
    while (!Q.empty()) {
      int v = Q.front();
      Q.pop();
      active[v] = false;
      Discharge(v);
    }
    long long int totflow = 0;
    for (long long int i = 0; i < G[s].size(); i++) totflow += G[s][i].flow;
    return totflow;
  }
  vector<vector<Edge> > build() { return G; }
};
vector<pair<long long int, long long int> > v;
vector<pair<pair<long long int, long long int>, long long int> > nodes;
int main() {
  ios::sync_with_stdio(false);
  ;
  cin.tie(0);
  ;
  long long int i, j, n, b, q, x, y, l, r, upto, quan, flow, prev, sink, id,
      prev_q;
  cin >> n >> b >> q;
  for (i = 1; i <= q; i++) {
    cin >> upto >> quan;
    v.push_back(make_pair(upto, quan));
  }
  v.push_back(make_pair(b, n));
  sort(v.begin(), v.end());
  prev = 0;
  prev_q = 0;
  for (i = 0; i < v.size(); i++) {
    l = prev + 1;
    r = v[i].first;
    quan = v[i].second;
    if (quan - prev_q < 0) {
      cout << "unfair";
      return 0;
    }
    nodes.push_back(make_pair(make_pair(l, r), quan - prev_q));
    prev = v[i].first;
    prev_q = v[i].second;
  }
  PushRelabel network(nodes.size() + 7);
  for (i = 1; i <= 5; i++) network.AddEdge(0, i, n / 5);
  id = 5;
  sink = 5 + nodes.size() + 1;
  for (i = 0; i < nodes.size(); i++) {
    id++;
    l = nodes[i].first.first;
    r = nodes[i].first.second;
    quan = nodes[i].second;
    network.AddEdge(id, sink, quan);
    for (j = l; j <= r; j++) network.AddEdge(j % 5 + 1, id, 1);
  }
  flow = network.GetMaxFlow(0, sink);
  if (flow == n)
    cout << "fair";
  else
    cout << "unfair";
  return 0;
}
