【codeforces gym 100187J】 【dfs判连通】Deck Shuffling 【给你一堆牌和一些洗牌机，后者可以改变牌的顺序，问你能不能把数字为x的牌洗到第一个位置。】

传送门：J. Deck Shuffling

描述：

J. Deck Shuffling

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The world famous scientist Innokentiy continues his innovative experiments with decks of cards. Now he has a deck of n cards and kshuffle machines to shuffle this deck. As we know, i-th shuffle machine is characterized by its own numbers pi, 1, pi, 2, ..., pi, n such that if one puts n cards numbered in the order 1, 2, ..., n into the machine and presses the button on it, cards will be shuffled forming the deckpi, 1, pi, 2, ..., pi, n where numbers pi, 1, pi, 2, ..., pi, n are the same numbers of cards but rearranged in some order.

At the beginning of the experiment the cards in the deck are ordered as a1, a2, ..., an, i.e. the first position is occupied by the card with number a1, the second position — by the card with number a2, and so on. The scientist wants to transfer the card with number x to the first position. He can use all his shuffle machines as many times as he wants. You should determine if he can reach it.

Input

In the first line the only positive integer n is written — the number of cards in the Innokentiy's deck.

The second line contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ n) — the initial order of cards in the deck.

The third line contains the only positive integer k — the number of shuffle machines Innokentiy has.

Each of the next k lines contains n distinct integers pi, 1, pi, 2, ..., pi, n (1 ≤ pi, j ≤ n) characterizing the corresponding shuffle machine.

The last line contains the only integer x (1 ≤ x ≤ n) — the number of card Innokentiy wants to transfer to the first position in the deck.

Numbers n and k satisfy the condition 1 ≤ n·k ≤ 200000.

Output

Output «YES» if the scientist can transfer the card with number x to the first position in the deck, and «NO» otherwise.

Examples

input

4
4 3 2 1
2
1 2 4 3
2 3 1 4
1

output

YES

input

4
4 3 2 1
2
1 2 4 3
2 1 3 4
1

output

NO

题意：

给你一堆牌，和一些洗牌机，可以改变牌的顺序，问你能不能通过洗牌机把数字为x的牌洗到第一个位置。

思路：

除了x其他元素可以直接不用考虑，为了操作方便，反向建边，然后dfs判断连通性

代码：

#include <bits/stdc++.h>
#define pr(x) cout << #x << "= " << x << "  " ；
#define pl(x) cout << #x << "= " << x << endl;
#define ll __int64
#define mod 1000000007
using  namespace  std;

#define mst(ss,b) memset(ss,b,sizeof(ss));
#define rep(i,k,n) for(int i=k;i<=n;i++)

template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
    for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
    F && (num=-num);
}

const int N=2e5+10;

std::vector<int> son[N];
int n,k,x,a[N],vis[N];

bool dfs(int u){
  if(a[u]==x)return true;
  for(auto v : son[u]){//auto的用法
    if(!vis[v]){
      vis[v]=1;
      if(dfs(v))return true;
    }
  }
  return false;
}

int  main(){
  #ifndef ONLINE_JUDGE
  freopen("in.txt","r",stdin);
  #endif

  read(n);
  rep(i, 1, n)read(a[i]);
  read(k);
  rep(i, 1, k){
    rep(j, 1, n){
      int t;
      read(t);
      if(t!=j)son[j].push_back(t);
    }
  }
  read(x);
  printf("%s\n", dfs(1)?"YES":"NO");
  return 0;
}