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

template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
	typedef Point P;
	T x, y;
	explicit Point(T x=0, T y=0) : x(x), y(y) {}
	bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
	bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
	bool operator!=(P p) const { return tie(x,y)!=tie(p.x,p.y); }
	P operator+(P p) const { return P(x+p.x, y+p.y); }
	P operator-(P p) const { return P(x-p.x, y-p.y); }
	P operator*(T d) const { return P(x*d, y*d); }
	P operator/(T d) const { return P(x/d, y/d); }
	T dot(P p) const { return x*p.x + y*p.y; }
	T cross(P p) const { return x*p.y - y*p.x; }
	T cross(P a, P b) const { return (a-*this).cross(b-*this); }
	T dist2() const { return x*x + y*y; }
	double dist() const { return sqrt((double)dist2()); }
	// angle to x-axis in interval [-pi, pi]
	double angle() const { return atan2(y, x); }
	P unit() const { return *this/dist(); } // makes dist()=1
	P perp() const { return P(-y, x); } // rotates +90 degrees
	P normal() const { return perp().unit(); }
	// returns point rotated 'a' radians ccw around the origin
	P rotate(double a) const {
		return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
	friend ostream& operator<<(ostream& os, P p) {
		return os << p.x << " " << p.y ; }
};

typedef Point<double> P;

signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n,m;
	cin >> m >> n;
	double l;
	cin >> l;
	vector<P>ans;
	ans.push_back(P{0,0});
	P cur{0,0};
	double d = 0;
	int i = 1;
	P end{(double)m,(double)n};
	int cury = 0;
	while(true){
		if(i%2==1){
			P p{(double)m,cur.y};
			if(d+(p-cur).dist() + (p-end).dist() < l){
				if(ans.back()!=p)ans.push_back(p);
				d+=(p-cur).dist();
				cur = p;
			}
			else{
				double low = 0; double high = m;
				for(int iters = 0; iters < 100; iters++){
					double mid = (low+high)/2;
					P p2{mid,cur.y};

					if(d+(p2-cur).dist() + (p2-end).dist() < l){
						low = mid;
					}
					else{
						high = mid;
					}
				}
				P p2{low,cur.y};
				if(ans.back()!=p2)ans.push_back(p2);
				break;
			}
		}
		else{
			P p{0,(double)(i/2)};
			if(d+(p-cur).dist() + (p-end).dist() < l){
				if(ans.back()!=p)ans.push_back(p);
				d+=(p-cur).dist();
				cur = p;
			}
			else{
				double low = 0; double high = m;
				for(int iters = 0; iters < 100; iters++){
					double mid = (low+high)/2;
					P p2{mid,(double)(i/2)};
					if(d+(p2-cur).dist() + (p2-end).dist() > l){
						low = mid;
					}
					else{
						high = mid;
					}
				}
				P p2{low,(double)(i/2)};
				if(ans.back()!=p2)ans.push_back(p2);
				//cout << "gay\n";
				break;
			}
		}
		i++;
	}
	ans.push_back(end);
	cout << ans.size() << '\n';
	cout << fixed << setprecision(10);
	for(auto nxt: ans){
		cout << nxt << '\n';
	}
	return 0;
}