#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
using ld = long double;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 305, K = 30, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

#define X first
#define Y second

ld dist(ld x, ld y, ld x2, ld y2)
{
    return sqrt(abs(x-x2)*abs(x-x2)+abs(y-y2)*abs(y-y2));
}

void solve() {
    int x = 0, y = 0;
    vector<pair<ld,ld>> A;
    int n, m;
    cin >> n >> m;
    ld L;
    cin >> L;
    A.push_back({0,0});
    while (true)
    {
        int x2 = x, y2 = y;
        if (x%2==0 and y==0) y2 = m;
        if (x%2==0 and y==m) x2++;
        if (x%2==1 and y==0) x2++;
        if (x%2==1 and y==m) y2 = 0;
        ld D = dist(x,y,x2,y2)+dist(x2,y2,n,m);
        if (L>D)
        {
            L -= dist(x,y,x2,y2);
            x = x2, y = y2;
            A.push_back({x,y});
            continue;
        }
        ld l = 0, r = 1;
        for (int w=0;w<60;w++)
        {
            ld M = (l+r)/2;
            ld x3 = x2*M+x*(1-M), y3 = y2*M+y*(1-M);
            D = dist(x,y,x3,y3)+dist(x3,y3,n,m);
            if (D<L) l = M;
            else r = M;
        }
        ld x3 = x2*l+x*(1-l), y3 = y2*l+y*(1-l);
        A.push_back({x3,y3});
        A.push_back({n,m});
        break;
    }
    cout.precision(20);
    cout << A.size() << "\n";
    for (int i=0;i<A.size();i++)
    {
        cout << A[i].X << " " << A[i].Y << "\n";
    }
}


int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}