#include <bits/stdc++.h>
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
using namespace std;
class pa3 {
 public:
  int x, y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  int x;
  int y, z, w;
  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator>(const pa2 &p) const { return x != p.x ? x > p.x : y > p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
class Point {
 public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < (1e-7) && fabs(y - p.y) < (1e-7);
  }
};
struct Segment {
  Point p1, p2;
};
double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
bool parareru(Point a, Point b, Point c, Point d) {
  return abs(cross(a - b, d - c)) < (1e-7);
}
double distance_ls_p(Point a, Point b, Point c) {
  if (dot(b - a, c - a) < (1e-7)) return (c - a).absv();
  if (dot(a - b, c - b) < (1e-7)) return (c - b).absv();
  return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
    return false;
  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
    if (dot(a.p1 - b.p1, a.p1 - b.p2) < (1e-7)) return true;
    if (dot(a.p2 - b.p1, a.p2 - b.p2) < (1e-7)) return true;
    if (dot(a.p1 - b.p1, a.p2 - b.p1) < (1e-7)) return true;
    if (dot(a.p1 - b.p2, a.p2 - b.p2) < (1e-7)) return true;
    return false;
  } else
    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
            (1e-7)) &&
           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
            (1e-7));
}
double segment_dis(Segment a, Segment b) {
  if (is_intersected_ls(a, b)) return 0;
  double r = distance_ls_p(a.p1, a.p2, b.p1);
  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
  return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2 - b.p1;
  double d1 = abs(cross(ba, a.p1 - b.p1));
  double d2 = abs(cross(ba, a.p2 - b.p1));
  double t = d1 / (d1 + d2);
  return a.p1 + (a.p2 - a.p1) * t;
}
string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}
int gcd(int v, int b) {
  if (v > b) return gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return gcd(v, b % v);
}
double distans(double x1, double y1, double x2, double y2) {
  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return sqrt(rr);
}
int beki(int wa, int rr, int warukazu) {
  if (rr == 0) return 1ll;
  if (rr == 1) return wa % warukazu;
  if (rr % 2 == 1) return (beki(wa, rr - 1, warukazu) * wa) % warukazu;
  int zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
int y = 0;
struct segsum2D {
 private:
 public:
  static const int corx = (1 << 12);
  static const int cory = (1 << 12);
  vector<vector<int>> vec;
  void shoki1() { vec.resize(2 * corx + 3, vector<int>(2 * cory + 2, 0)); }
  void shoki2() {
    for (int i = 2 * corx - 1; i > 0; i--)
      for (int j = 2 * cory - 1; j > 0; j--) {
        if (i >= corx && j >= cory) continue;
        if (i >= corx)
          vec[i][j] = vec[i][2 * j] ^ vec[i][2 * j + 1];
        else
          vec[i][j] = vec[2 * i][j] ^ vec[2 * i + 1][j];
      }
  }
  void updadd(int x, int y, int w) {
    x += corx;
    y += cory;
    vec[x][y] ^= w;
    for (int i = x; i > 0; i /= 2)
      for (int j = y; j > 0; j /= 2) {
        if (i == x && j == y) continue;
        if (i >= corx)
          vec[i][j] = vec[i][2 * j] ^ vec[i][2 * j + 1];
        else
          vec[i][j] = vec[2 * i][j] ^ vec[2 * i + 1][j];
      }
  }
  void updchan(int x, int y, int w) {
    x += corx;
    y += cory;
    vec[x][y] = w;
    for (int i = x; i > 0; i /= 2)
      for (int j = y; j > 0; j /= 2) {
        if (i == x && j == y) continue;
        if (i >= corx)
          vec[i][j] = vec[i][2 * j] ^ vec[i][2 * j + 1];
        else
          vec[i][j] = vec[2 * i][j] ^ vec[2 * i + 1][j];
      }
  }
  int ax;
  int ay;
  int bx;
  int by;
  int _kx;
  int _sumy(int ky = 1, int ly = 0, int ry = cory) {
    y++;
    if (ay <= ly && ry <= by) {
      return vec[_kx][ky];
    }
    if (ly >= by || ry <= ay) {
      return 0;
    }
    int my = (ly + ry) / 2;
    int v00 = _sumy(2 * ky, ly, my);
    int v10 = _sumy(2 * ky + 1, my, ry);
    return v00 ^ v10;
  }
  int _sumx(int kx = 1, int lx = 0, int rx = corx) {
    y++;
    if (ax <= lx && rx <= bx) {
      _kx = kx;
      return _sumy();
    }
    if (lx >= bx || rx <= ax) {
      return 0;
    }
    int mx = (lx + rx) / 2;
    int v00 = _sumx(2 * kx, lx, mx);
    int v10 = _sumx(2 * kx + 1, mx, rx);
    return v00 ^ v10;
  }
  int sum(int axx, int bxx, int ayy, int byy) {
    ax = axx;
    ay = ayy;
    bx = bxx;
    by = byy;
    return _sumx();
  }
};
segsum2D ss;
unsigned int randxor() {
  static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
  unsigned int tt;
  tt = (x ^ (x << 11));
  x = y;
  y = z;
  z = w;
  return (w = (w ^ (w >> 19)) ^ (tt ^ (tt >> 8)));
}
map<pa4, int> ma;
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ss.shoki1();
  ss.shoki2();
  int n, m, q;
  cin >> n >> m >> q;
  for (int i = 0; i < q; i++) {
    int t, x1, x2, y1, y2;
    cin >> t >> x1 >> y1 >> x2 >> y2;
    if (t == 1) {
      int va = randxor();
      ma[(pa4){x1, y1, x2, y2}] = va;
      ss.updadd(x1, y1, va);
      ss.updadd(x2 + 1, y1, va);
      ss.updadd(x1, y2 + 1, va);
      ss.updadd(x2 + 1, y2 + 1, va);
    }
    if (t == 2) {
      int va = ma[(pa4){x1, y1, x2, y2}];
      ss.updadd(x1, y1, va);
      ss.updadd(x2 + 1, y1, +va);
      ss.updadd(x1, y2 + 1, +va);
      ss.updadd(x2 + 1, y2 + 1, va);
    }
    if (t == 3) {
      if (ss.sum(0, x1 + 1, 0, y1 + 1) == ss.sum(0, x2 + 1, 0, y2 + 1))
        cout << "Yes\n";
      else
        cout << "No\n";
    }
  }
  return 0;
}
