# 小姬小姬小姬

1 1 2


0.000000 0.000000
1.000000 0.000000
0.000000 1.000000


#include<cstdio>
#include<cmath>
using namespace std;
int a,b,c;
int main()
{
scanf("%d%d%d",&a,&b,&c);
printf("0 0\n");
printf("0 %d\n",a);
for(int i=400;i>=-400;i--)
for(int j=-400;j<=400;j++)
{
if(abs(i)+abs(j)==2*b&&abs(i)+abs(j-2*a)==2*c)
{
printf("%d.%d %d.%d\n",i/2,i%2?5:0,j/2,j%2?5:0);
return 0;
}
}
}


#include <bits/stdc++.h>
#define IO                       \
ios::sync_with_stdio(false); \
cin.tie(0);                  \
cout.tie(0);
#define mem(a, x) memset(a, x, sizeof(a))
#define per(x, a, b) for (int x = a; x <= b; x++)
#define rep(x, a, b) for (int x = a; x >= b; x--)

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-8;

int main() {
#ifdef LOCAL_IM0QIANQIAN
freopen("test.in", "r", stdin);
//    freopen("test.out", "w", stdout);
#else
// IO;
#endif // LOCAL_IM0QIANQIAN

double a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
double x = (a[1] + a[2] - a[0]) / 2.0;
double a1 = a[1] - x;
// double a2 = a[2] - x;
printf("%.6f %.6f\n", 0.0, 0.0);
printf("%.6f %.6f\n", a[0], 0.0);
printf("%.6f %.6f\n", a1, x);
return 0;
}