#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int INF = 1e9 + 7;
const double EPS = 1e-6;

struct point
{
	double x, y;
	
	point() {}
	point(double a, double b): x(a), y(b) {};
	point operator +(const point& p) const
	{
		return point(x + p.x, y + p.y);
	}
	point operator -(const point& p) const
	{
		return point(x - p.x, y - p.y);
	}
	point operator *(double d) const
	{
		return point(x * d, y * d);
	}
	double d2()
	{
		return sqrt(x * x + y * y);
	}
};

double dis(point a, point b)
{
	a = a - b;
	return a.d2();
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m;
	cin >> n >> m;
	double l;
	cin >> l;
	vector<point> ans;
	int j = 0;
	point a(0, 0);
	ans.PB(a);
	point b(n, 0);
	point c(0, 1);
	point d(n, m);
	while (dis(a, b) + dis(b, c) + dis(c, d) < l)
	{
		ans.PB(b);
		ans.PB(c);
		a.y += 1;
		b.y += 1;
		c.y += 1;
		l -= dis(a, b) + dis(b, c);
		j++;
	}
	assert(l + EPS > dis(a, d));
	double L = 0, R = 1;
	point v1(n, 0);
	point v2(-n, 0);
	FOR (i, 0, 100)
	{
		double M = (L + R) / 2;
		b = a + v1 * M;
		c = d + v2 * M;
		double ds = dis(a, b) + dis(b, c) + dis(c, d);
		if (ds < l)
			L = M;
		else
			R = M;
	}
	ans.PB(a + v1 * L);
	ans.PB(d + v2 * L);
	ans.PB(d);
	cout << fixed << setprecision(7) << SZ(ans) << '\n';
	for (auto p : ans)
		cout << p.x << ' ' << p.y << '\n';
	
	
	return 0;
}