Baekjoon #1976

#include<bits/stdc++.h>

using namespace std;

int uf[40404];

int find(int x) {
    if(uf[x] < 0) return x;
    return uf[x] = find(uf[x]);
}

bool merge(int a, int b) {
    a = find(a);
    b = find(b);
    if(a == b)return false;
    uf[b] = a;
    return true;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N, M; cin >> N >> M;
    for(int i=0;i<=N;i++)uf[i] = -1;
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++) {
            int x;cin >> x;
            if(x) merge(i, j);
        }
    }
    int pre; cin >> pre;
    bool answer = true;
    for(int i=1;i<M;i++){
        int cur; cin >> cur;
        if(find(pre) != find(cur)) answer = false;
        pre = cur;
    }
    if(answer) cout << "YES";
    else cout << "NO";

    return 0;
}

import sys

def input():
    return sys.stdin.readline().rstrip()

def union(x,y):
    x = find_parent(x)
    y = find_parent(y)
    if x < y:
        parent[y] = x
    else:
        parent[x] = y
    
def find_parent(x):
    if parent[x] != x:
        parent[x] = find_parent(parent[x])
    return parent[x]

N = int(input())
M = int(input())
parent = [i for i in range(N)]
arr = []
for i in range(N):
    arr.append(list(map(int, input().split())))
for i in range(N):
    for j in range(N):
        if arr[i][j] == 1:
            a = find_parent(i)
            b = find_parent(j)
            union(a,b)
ans = list(map(int, input().split()))
flag = 0
standard = ans[0] - 1
for i in range(1, len(ans)):
    if parent[standard] != parent[ans[i]-1]:
        flag = 1
        break
if not flag:
    print('YES')
else:
    print('NO')