#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 500;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };


using speP = pair<ld, int>;

int w, h, n;

ld x[200], y[200];
void solve() {
	rep(i, 2 * n) {
		cin >> x[i] >> y[i];
	}
	int czero = 0;
	rep(i, 2 * n)if (x[i] == 0)czero++;
	vector<ld> ts;
	ts.push_back(0);
	ts.push_back(h);
	rep(i, 2*n) {
		Rep(j, i + 1, 2*n) {
			if (x[i] == x[j])continue;
			ld dx = x[j] - x[i];
			ld dy = y[j] - y[i];
			ld r = dy / dx;
			ld t = y[i] - r * x[i];
			if (t > 0 && t < h)ts.push_back(t);
		}
	}
	rep(i, 2 * n) {
		if (x[i] == w)continue;
		ld r = (h - y[i]) / (w - x[i]);
		ld t = y[i] - r * x[i];
		if (t > 0 && t < h)ts.push_back(t);
		r = -y[i] / (w - x[i]);
		t = y[i] - r * x[i];
		if (t > 0 && t < h)ts.push_back(t);
	}
	sort(all(ts));

	vector<ld> les(2*n), ris(2 * n);
	int len = ts.size();
	ld ans = 0;
	rep(i, len - 1) {
		ld le = ts[i], ri = ts[i + 1];
		ld mid = (le + ri) / 2.0;
		vector<speP> v;
		int tmp = 0;
		rep(j, 2 * n) {
			if (x[j] == 0) {
				if (y[j] < mid)tmp++;
				continue;
			}
			ld r = (y[j] - mid) / x[j];
			v.push_back({ r,j });
		}
		sort(all(v));

		if (tmp > n)continue;
		if (czero - tmp > n)continue;
		ld cl=0, cr=h;
		if (n - 1 - tmp >= 0 && n - 1 - tmp < v.size()) {
			int id = v[n - 1 - tmp].second;
			ld r = v[n - 1 - tmp].first;
			cl = r * w + mid;
			cl = max(cl, (ld)0);
		}
		if (n - tmp >= 0 && n - tmp < v.size()) {
			int id = v[n - tmp].second;
			ld r = v[n - tmp].first;
			cr = r * w + mid;
			cr = min(cr, (ld)h);
		}
		if (cl > cr)continue;
		ld len = ts[i + 1] - ts[i];
		//cout << ts[i] << " " << ts[i + 1] << " " << cl<<" "<<cr << endl;
		ans += len * (cr - cl);
	}
	ans /= (ld)(h*h);
	cout << ans << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f(); init();
	//int t; cin >> t; rep(i, t)solve();
	while(cin>>w>>h>>n,n)solve();
	stop
		return 0;
}


Measured memory_bytes: 3532