description: 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 a_{x,y} denoting the direction of how the ball will move.
  
    * a_{x,y}=1 — the ball will move to the right (the next cell is (x, y + 1)); 
    * a_{x,y}=2 — the ball will move to the bottom (the next cell is (x + 1, y)); 
    * a_{x,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 a_{x,y} will change to 2. Mr. Chanek will drop k balls sequentially, each starting from the first row, and on the c_1, c_2, ..., c_k-th (1 ≤ c_i ≤ 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 ≤ 10^5) — 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 a_{i,1},a_{i,2},…,a_{i,m} (1 ≤ a_{i,j} ≤ 3). It will satisfy a_{i, 1} ≠ 3 and a_{i, m} ≠ 1.
  
  The next line contains k integers c_1, c_2, …, c_k (1 ≤ c_i ≤ 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.
  
  Examples
  
  Input
  
  
  5 5 3
  1 2 3 3 3
  2 2 2 2 2
  2 2 2 2 2
  2 2 2 2 2
  2 2 2 2 2
  1 2 1
  
  
  Output
  
  
  2 2 1 
  
  
  Input
  
  
  1 2 2
  1 3
  1 2
  
  
  Output
  
  
  1 2 
  
  Note
  
  In the first example, the first ball will drop as follows. Note that the cell (1, 1) will change direction to the bottom direction.
  
  <image>
  
  The second and third balls will drop as follows. 
  
  <image>
  
  All balls will be dropped from the first row and on the c_1, c_2, ..., c_k-th columns respectively. A ball will stop dropping once it leaves the grid.
solution: import os,sys;from io import BytesIO, FileIO, IOBase
  BUFSIZE = 8192
  class FastIO(IOBase):
      newlines = 0
      def __init__(self, file):
          self._fd = file.fileno();self.buffer = BytesIO();self.writable = "x" in file.mode or "r" not in file.mode;self.write = self.buffer.write if self.writable else None
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:break
              ptr = self.buffer.tell();self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
      def readline(self):
          while self.newlines == 0:b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE));self.newlines = b.count(b"\n") + (not b);ptr = self.buffer.tell();self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
      def flush(self):
          if self.writable:os.write(self._fd, self.buffer.getvalue());self.buffer.truncate(0), self.buffer.seek(0)
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file);self.flush = self.buffer.flush;self.writable = self.buffer.writable;self.write = lambda s: self.buffer.write(s.encode("ascii"));self.read = lambda: self.buffer.read().decode("ascii");self.readline = lambda: self.buffer.readline().decode("ascii")
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  try:sys.stdin,sys.stdout=open('in.txt','r'),open('out.txt','w')
  except:pass
  ii1=lambda:int(sys.stdin.readline().strip()) # for interger
  is1=lambda:sys.stdin.readline().strip() # for str
  iia=lambda:list(map(int,sys.stdin.readline().strip().split())) # for List[int]
  isa=lambda:sys.stdin.readline().strip().split() # for List[str]
  mod=int(1e9 + 7);
  # from math import *
  # from math import inf 
  # from collections import *;
  from collections import defaultdict as dd
  # from collections import deque as dq 
  # from string import ascii_lowercase,ascii_uppercase
  # from functools import lru_cache
  # sys.setrecursionlimit(500000)
  # from bisect import bisect_left as bl,bisect_right as br
  # from heapq import heapify,heappop,heappush
  # def google(p):print('Case #'+str(p)+': ',end='')
  # snippets
  # @f - for loop 
  # @bfs - breadth first search 
  # @Trie - Trie Data Structure 
  # @rangeupdatepointquery - range update
  
  ###################### Start Here ######################
  def main(t):
      n,m,k = iia()
      arr = []
      for i in range(n):
          arr.append(iia())
      # now k 
      K = iia()
      dic = dd(int)
      res = []
      for q in range(k):
          start = K[q]-1
          shift = 0 
          # 1 - right 
          # 2 - down 
          # 3 - left 
          if start in dic:
              res.append(dic[start])
              continue 
          j = 0 
          while j < n :
              if 0<=start<m:
                  if arr[j][start] == 1:
                      arr[j][start] = 2
                      start += 1
                      shift += 1
                  elif arr[j][start] == 3:
                      arr[j][start] = 2
                      start -= 1
                      shift += 1
                  else:
                      j+=1
              else:
                  break 
          if shift == 0 : 
              dic[K[q]-1] = start+1
          res.append(start+1)
      print(*res)
      
  
  
      
       
  
  
  
  if __name__ == "__main__":
      t = 1 
      # t = ii1()
      for _ in range(t):
          main(_)