output_description: Print the maximum value of f.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 ... a_N
attempt: # 高橋君！の問題について
  # したのコードでTLEになってしまうのは、もうPythonの限界なのか、
  # 無駄なプロセスがあるのかどうかを聞く。
  
  H, W = map(int, input().split())
  mp = [list(input()) for _ in range(H)]
  for i in range(H):
      for j in range(W):
          if mp[i][j] == "s":
              start = (i, j)
          elif mp[i][j] == "g":
              goal = (i, j)
  dxy = [(1, 0), (0, 1), (-1, 0), (0, -1)]
  import queue
  from collections import defaultdict
  
  q = queue.Queue()
  d = defaultdict()
  q.put(start)
  while not q.empty():
      now = q.get()
      if not now in d.keys():
          d[now] = 0
      for dx, dy in dxy:
          n_0 = now[0] + dx
          n_1 = now[1] + dy
          # すでに行っていたとしても、塀をより壊していない
          # ルートなら採用するべき
          if (n_0, n_1) in set(d.keys()):
              if mp[n_0][n_1] == "#":
                  if d[(n_0, n_1)] > d[now] + 1:
                      q.put((n_0, n_1))
                      d[(n_0, n_1)] = d[now] + 1
              else:
                  if d[(n_0, n_1)] > d[now]:
                      q.put((n_0, n_1))
                      d[(n_0, n_1)] = d[now]
          else:  # 初めてのルート
              if 0 <= n_0 < H and 0 <= n_1 < W:
                  if mp[n_0][n_1] == "g":
                      print("YES")
                      exit(0)
                  elif mp[n_0][n_1] == "#":
                      if d[now] < 2:
                          q.put((n_0, n_1))
                          d[(n_0, n_1)] = d[now] + 1
                  else:
                      q.put((n_0, n_1))
                      d[(n_0, n_1)] = d[now]
  print("NO")
  
problem_description: Statement
  
  You are given N positive integers a_1, a_2, ..., a_N.
  
  For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... +
  (m\ mod\ a_N).
  
  Here, X\ mod\ Y denotes the remainder of the division of X by Y.
  
  Find the maximum value of f.
samples: [{"input": "3\n    3 4 6", "output": "10\n    \n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value\nof f.\n\n* * *"}, {"input": "5\n    7 46 11 20 11", "output": "90\n    \n\n* * *"}, {"input": "7\n    994 518 941 851 647 2 581", "output": "4527"}]