题目链接：https://cn.vjudge.net/problem/Gym-101142A
#include<bits/stdc++.h>
using namespace std;#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))#define pii pair<ll,ll>
#define mk(x,y) make_pair(x,y)const int maxn =1e5+5;
const int mod=1e9+7;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}int x,y,ax,ay,bx,by;int main()
{freopen("anniversary.in","r",stdin);freopen("anniversary.out","w",stdout);while(scanf("%d %d %d %d %d %d",&x,&y,&ax,&ay,&bx,&by)!=EOF){if(ax!=bx)printf("%d %d %d %d",ax,0,bx,y);else printf("%d %d %d %d",0,ay,x,by);}return 0;
}