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: def main():
      alpha = 'abcdefghijklmnopqrstuvwxyz'
      ALPHA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
      inf = 1e17
      # mod = 998244353
      mod = 10 ** 9 + 7
  
      # Max = 10 ** 6
      # primes = []
      # prime = [True for i in range(Max + 1)]
      # p = 2
      # while (p * p <= Max + 1):
      #
      #     # If prime[p] is not
      #     # changed, then it is a prime
      #     if (prime[p] == True):
      #
      #         # Update all multiples of p
      #         for i in range(p * p, Max + 1, p):
      #             prime[i] = False
      #     p += 1
      #
      # for p in range(2, Max + 1):
      #     if prime[p]:
      #         primes.append(p)
  
      # print(len(primes))
  
      def factorial(n):
          f = 1
  
          for i in range(1, n + 1):
              f = (f * i) % mod  # Now f never can
          # exceed 10^9+7
  
          return f
  
      def factorial_by(n, by):
          f = 1
  
          for i in range(1, n + 1):
              if i == by:
                  continue
              f = (f * i) % mod  # Now f never can
          # exceed 10^9+7
  
          return f
  
      def ncr(n, r):
          # initialize numerator
          # and denominator
          num = den = 1
          for i in range(r):
              num = (num * (n - i)) % mod
              den = (den * (i + 1)) % mod
          return (num * pow(den,
                            mod - 2, mod)) % mod
  
      def primeFactors(num):
  
          pf = []
          while num % 2 == 0:
              pf.append(2)
              num = num // 2
  
          # n must be odd at this point
          # so a skip of 2 ( i = i + 2) can be used
          for i in range(3, int(math.sqrt(num)) + 1, 2):
  
              # while i divides n , print i and divide n
              while num % i == 0:
                  pf.append(i)
                  num = num // i
  
          # Condition if n is a prime
          # number greater than 2
          if num > 2:
              pf.append(num)
  
          return pf
  
      class Node(object):
          def __init__(self, name, d):
              self.d = d
              self.name = name
  
          def __repr__(self):
              pass
  
      def solve(n,m,k,mat,q):
  
          sol, cache = [], [0] * m
          for c in q:
              cc = c - 1
              if cache[cc] == 0:
                  r, c, alldown = 0, c - 1, True
                  while r < n:
                      if mat[r][c] == 2:
                          r += 1
                      else:
                          alldown = False
                          mat[r][c], c = 2, c + 2 - mat[r][c]
                  if alldown:
                      cache[cc] = c + 1
                  sol.append(c + 1)
              else:
                  sol.append(cache[cc])
          
  
          return " ".join(list(map(str,sol)))
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
      t = 1#int(input())
      ans = []
      for _ in range(t):
          # s = list(input()[:-1])
          #n = int(input())
  
          n,m,k= map(int, input().split())
          grid = []
          for i in range(n):
              grid.append([int(x) for x in input().split()])
          #s = list(map(int,list(input()[:-1])))
          a = [int(x) for x in input().split()]
          # b = [int(x) for x in input().split()]
          # q = int(input())
          # queries = []
          # for i in range(q):
          #     x1,x2 = map(int, input().split())
          #     queries.append([x1,x2])
  
          # tree = []
          #
          #
          # for i in range(n+1):
          #     tree.append([])
          #
          # for i in range(n-1):
          #     u, v = map(int, input().split())
          #     tree[u].append(v)
          #     tree[v].append(u)
          #
          ans.append(solve(n,m,k,grid,a))
  
      p = 1
      for answer in ans:
          # print('Case #'+str(p)+": "+str(answer))
          print(answer)
          p += 1
  
  
  if __name__ == "__main__":
      import sys, threading
      import bisect
      import math
      import itertools
      from sys import stdout
  
      ############  Sorted Containers  ######################
      import heapq
      from queue import PriorityQueue
      from collections import deque
  
      ############ Tree Problems ( Use Python 3) ###########
      #sys.setrecursionlimit(2 ** 32 // 2 - 1)
      #threading.stack_size(1 << 27)
  
      input = sys.stdin.readline
      thread = threading.Thread(target=main)
      thread.start()
      thread.join()
  