Sagheer and Crossroads

 Sagheer and Crossroads

 CodeForces - 812A 

Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the intersection, so we have 4 parts in total. Each part has 4 lights, one for each lane getting into the intersection (l — left, s — straight, r — right) and a light p for a pedestrian crossing.

An accident is possible if a car can hit a pedestrian. This can happen if the light of a pedestrian crossing of some part and the light of a lane that can get to or from that same part are green at the same time.

Now, Sagheer is monitoring the configuration of the traffic lights. Your task is to help him detect whether an accident is possible.

Input

The input consists of four lines with each line describing a road part given in a counter-clockwise order.

Each line contains four integers l, s, r, p — for the left, straight, right and pedestrian lights, respectively. The possible values are 0 for red light and 1 for green light.

Output

On a single line, print "YES" if an accident is possible, and "NO" otherwise.

Examples

Input

1 0 0 1
0 1 0 0
0 0 1 0
0 0 0 1

Output

YES

Input

0 1 1 0
1 0 1 0
1 1 0 0
0 0 0 1

Output

NO

Input

1 0 0 0
0 0 0 1
0 0 0 0
1 0 1 0

Output

NO

Note

In the first example, some accidents are possible because cars of part 1 can hit pedestrians of parts 1 and 4. Also, cars of parts 2 and 3 can hit pedestrians of part 4.

In the second example, no car can pass the pedestrian crossing of part 4 which is the only green pedestrian light. So, no accident can occur.

题目大意：在人行道为绿灯时其他经过这条人行道的车道必须为红灯，分开讨论即可

AC代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <set>
#include <utility>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define lep(i,l,r) for(int i=l;i>=r;i--)
#define ms(arr) memset(arr,0,sizeof(arr))
//priority_queue<int,vector<int> ,greater<int> >q;
const int maxn = (int)1e5 + 5;
const ll mod = 1e9+7;
int mapp[10][10];
int main() 
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(0),cin.tie(0);
    bool j=false;
    rep(i,1,4) {
    	rep(j,1,4) {
    		cin>>mapp[i][j];
    	}
    }
    int a1,a2,a3,a4;
    a1=mapp[1][1]+mapp[1][2]+mapp[1][3]+mapp[4][3]+mapp[3][2]+mapp[2][1];
    a2=mapp[2][1]+mapp[2][2]+mapp[2][3]+mapp[1][3]+mapp[4][2]+mapp[3][1];
    a3=mapp[3][1]+mapp[3][2]+mapp[3][3]+mapp[2][3]+mapp[1][2]+mapp[4][1];
    a4=mapp[4][1]+mapp[4][2]+mapp[4][3]+mapp[3][3]+mapp[2][2]+mapp[1][1];
    if(mapp[1][4]==1&&a1!=0)
    	j=true;
    if(mapp[2][4]==1&&a2!=0)
    	j=true;
    if(mapp[3][4]==1&&a3!=0)
    	j=true;
    if(mapp[4][4]==1&&a4!=0)
    	j=true;
    if(j)
    	cout<<"YES"<<endl;
    else
    	cout<<"NO"<<endl;
    return 0;
}