#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> inline void chmax(T& a, const T b){a=max(a,b);}
template <class T> inline void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

//Seat Pressure O(NlogN)
template<class T> vector<int> Zarts(const vector<T> & ar, int cnt = 0) {
    vector<int> res;
    map<T, int> mp;
    for (auto &e : ar) mp[e] = 0;
    for (auto &e : mp) e.second = cnt++;
    for (auto &e : ar) res.push_back(mp[e]);
    return res;
}

//verify https://atcoder.jp/contests/abc036/tasks/abc036_c

int main() {
	SPEED
	while(1){
		int H,W,N; cin >> W >> H;
		if(H==0 && W == 0) return 0; 
		cin >> N;
		vector<int> zx,zy;
		for(int i = 0; i < N; ++i){
			int x1,x2,y1,y2;
			cin >> x1 >> y1 >> x2 >> y2;
			x2--,y2--;
			zx.push_back(max(x1-1,0));
			zx.push_back(x1);
			zx.push_back(min(x1+1,W));
			zx.push_back(max(x2-1,0));
			zx.push_back(x2);
			zx.push_back(min(x2+1,W));
			zy.push_back(max(y1-1,0));
			zy.push_back(y1);
			zy.push_back(min(y1+1,H));
			zy.push_back(max(y2-1,0));
			zy.push_back(y2);
			zy.push_back(min(y2+1,H));
		}
		zx.push_back(0);
		zx.push_back(1);
		zx.push_back(W-1);
		zx.push_back(W);
		zy.push_back(0);
		zy.push_back(1);
		zy.push_back(H-1);
		zy.push_back(H);

		zx = Zarts(zx);
		zy = Zarts(zy);

		int A = *max_element(ALL(zy)) + 1;
		int B = *max_element(ALL(zx)) + 1;
		vector<int> grid(A*B,0);
		for(int i = 0; i < A; ++i) grid[i*B+(B-1)] = 1;
		for(int j = 0; j < B; ++j) grid[(A-1)*B+j] = 1;

		for(int i = 0; i < N; ++i){
			int zx1 = zx[6*i + 1];
			int zx2 = zx[6*i + 4];
			int zy1 = zy[6*i + 1];
			int zy2 = zy[6*i + 4];
			grid[zy1*B+zx1]++;
			grid[zy1*B+zx2+1]--;
			grid[(zy2+1)*B+zx1]--;
			grid[(zy2+1)*B+zx2+1]++;
		}

		for(int i = 0; i < A; ++i){
			for(int j = 1; j < B; ++j) grid[i*B+j] += grid[i*B+(j-1)];
		}
		for(int j = 0; j < B; ++j){
			for(int i = 1; i < A; ++i) grid[i*B+j] += grid[(i-1)*B+j];
		}

		for(int i = 0; i < A; ++i){
			for(int j = 0; j < B; ++j) {
				if(grid[i*B+j]>=1) grid[i*B+j] = -1;
			}
		}

		int idx = 0;
		queue<int> q;
		for(int s = 0; s < A; ++s){
			for(int t = 0; t < B; ++t) {
				if(grid[s*B+t] != 0) continue;
				grid[s*B+t] = idx++;
				q.push(s*B+t);
				while (q.size()){
					int n = q.front();
					q.pop();
					int i = n/B, j = n%B;
					if(i+1<A && 0 == grid[(i+1)*B+j]) grid[(i+1)*B+j]=idx,q.push((i+1)*B+j);
					if(0<=i-1&& 0 == grid[(i-1)*B+j]) grid[(i-1)*B+j]=idx,q.push((i-1)*B+j);
					if(j+1<B && 0 == grid[i*B+(j+1)]) grid[i*B+(j+1)]=idx,q.push(i*B+(j+1));
					if(0<=j-1&& 0 == grid[i*B+(j-1)]) grid[i*B+(j-1)]=idx,q.push(i*B+(j-1));
				}
			}
		}
		cout << idx << endl;
	}
}



Measured memory_bytes: 9704