#include <bits/stdc++.h>

typedef double db;
typedef long double ld;
const ld eps = 1e-12;

inline ld dist(ld x1, ld y1, ld x2, ld y2) {
    return sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
}

inline ld dist(std::pair<ld, ld> x, std::pair<ld, ld> y) {
    return dist(x.first, x.second, y.first, y.second);
}

int n, m;
ld t;
std::vector<std::pair<ld, ld>> v;

int main() {
    scanf("%d%d%Lf", &n, &m, &t);
    std::pair<ld, ld> des(n, m), add(-1, -1);
    for (int i = 0; i <= n; ++i)
        v.emplace_back(i, 0), v.emplace_back(i, m);
    int fin = 0;
    for (int i = 1; i < v.size(); ++i) {
        if (dist(v[i], v[i - 1]) + dist(v[i], des) > t + eps) {
            fin = i;
            ld l = 0, r = 1;
            for (int j = 0; j < 256; ++j) {
                ld mid = (l + r) / 2.0;
                std::pair<ld, ld> cur(v[i - 1].first * (1 - mid) + v[i].first * mid, v[i - 1].second * (1 - mid) + v[i].second * mid);
                if (dist(v[i - 1], cur) + dist(cur, des) > t) r = mid; else l = mid;
            }
            std::pair<ld, ld> cur(v[i - 1].first * (1 - l) + v[i].first * l, v[i - 1].second * (1 - l) + v[i].second * l);
            if (dist(cur, v[i - 1]) > eps) add = cur;
            break;
        }
        t -= dist(v[i], v[i - 1]);
    }
    printf("%d\n", fin + (add.first != -1) + 1);
    for (int i = 0; i < fin; ++i) printf("%.10Lf %.10Lf\n", v[i].first, v[i].second);
    if (add.first != -1) printf("%.10Lf %.10Lf\n", add.first, add.second);
    printf("%d %d\n", n, m);
    return 0;
}