时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
题目描述
It is always hard to construct a good testcase for a geometry, like the problem I in EC Final 2019.
In order to manage the key to the testcase preparation, you need to find three points 
on a unit sphere such that %20%5Cgeq%201.7)
and the distance from original point %7D)
to the plane 
no more than 
. and greater than 
输入描述:
No input.
输出描述:
Output 3 lines. Each line contains 3 integersrepresenting a point
.
The checker is numerically stable, but it is not done in the exact arithmetic. So you might get wrong answer if your solution is too close to the constraint. For example, the distance of A and B is.
备注:
Of course, the output in the example is incorrect.