codeforces1575j

J. Jeopardy of Dropped Balls

https://codeforces.com/problemset/problem/1575/J

Mr. Chanek has a new game called Dropping Balls. Initially, Mr. Chanek
has a grid a of size n×m Each cell (x,y) contains an integer ax,y
denoting the direction of how the ball will move.

ax,y=1 — the ball will move to the right (the next cell is (x,y+1));
ax,y=2 — the ball will move to the bottom (the next cell is (x+1,y));
ax,y=3 — the ball will move to the left (the next cell is (x,y−1)).
Every time a ball leaves a cell (x,y), the integer ax,y will change to
2. Mr. Chanek will drop k balls sequentially, each starting from the first row, and on the c1,c2,…,ck-th (1≤ci≤m) columns.

Determine in which column each ball will end up in (position of the
ball after leaving the grid).

Input The first line contains three integers n, m, and k (1≤n,m≤1000,
1≤k≤105) — the size of the grid and the number of balls dropped by Mr.
Chanek.

The i-th of the next n lines contains m integers ai,1,ai,2,…,ai,m
(1≤ai,j≤3). It will satisfy ai,1≠3 and ai,m≠1.

The next line contains k integers c1,c2,…,ck (1≤ci≤m) — the balls’
column positions dropped by Mr. Chanek sequentially.

Output Output k integers — the i-th integer denoting the column where
the i-th ball will end.