#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

using pll = pair<ll,ll>;
using P = pair<pair<ll,ll>,pair<ll,ll>>;
ll w,h;
int n;
int t[3005][3005];

void solve(){
    cin >> n;
    vector<P> v(n);
    rep(i,n){
        ll x1,x2,y1,y2;
        cin >> x1 >> y1 >> x2 >> y2;
        v[i] = P(pll(x1,y1),pll(x2,y2));
    }

    map<ll,int> mpx,mpy;
    {
        set<ll> stx,sty;
        stx.insert(0); stx.insert(w);
        sty.insert(0); sty.insert(h);
        rep(i,n){
            ll x1 = v[i].first.first;
            ll y1 = v[i].first.second;
            ll x2 = v[i].second.first;
            ll y2 = v[i].second.second;
            for(int j=-1;j<=1;j++){
                if(0<=x1+j and x1+j<=w) stx.insert(x1+j);
                if(0<=x2+j and x2+j<=w) stx.insert(x2+j);
                if(0<=y1+j and y1+j<=h) sty.insert(y1+j);
                if(0<=y2+j and y2+j<=h) sty.insert(y2+j);
            }
        }

        int idx = 0;
        for(auto& x : stx){
            mpx[x] = idx++;
        }
        idx = 0;
        for(auto& y : sty){
            mpy[y] = idx++;
        }
    }


    w = mpx[w];
    h = mpy[h];
    rep(i,3005) rep(j,3005) t[i][j] = 0;

    rep(i,n){
        int x1 = mpx[v[i].first.first];
        int x2 = mpx[v[i].second.first];
        int y1 = mpy[v[i].first.second];
        int y2 = mpy[v[i].second.second];
        t[x1][y1]++;
        t[x1][y2]--;
        t[x2][y1]--;
        t[x2][y2]++;
    }

    for(int x=0;x<=w;x++){
        for(int y=0;y<=h;y++){
            t[x][y+1] += t[x][y];
        }
    }
    for(int y=0;y<=h;y++){
        for(int x=0;x<=w;x++){
            t[x+1][y] += t[x][y];
        }
    }

    /* for(int y=h;y>=0;y--){ */
    /*     for(int x=0;x<=w;x++){ */
    /*         cout << t[x][y]; */
    /*     } */
    /*     cout << endl; */
    /* } */

    int ans = 0;
    for(int x=0;x<w;x++){
        for(int y=0;y<h;y++){
            if(t[x][y]!=0) continue;

            ans++;
            queue<pii> que;
            que.push(pii(x,y));
            t[x][y] = 1;
            while(!que.empty()){
                int nowx = que.front().first;
                int nowy = que.front().second;
                que.pop();

                for(int k=0;k<4;k++){
                    int nx = nowx + dx[k];
                    int ny = nowy + dy[k];
                    if(0 <= nx && nx < w && 0 <= ny && ny < h){
                        if(t[nx][ny]!=0) continue;
                        t[nx][ny] = 1;
                        que.push(pii(nx,ny));
                    }
                }
            }
        }
    }
    cout << ans << endl;
}

int main(){
    while(1){
        cin >> w >> h;
        if(!w && !h) break;
        solve();
    }
}



Measured memory_bytes: 38620