class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
      row = len(obstacleGrid)
      col = len(obstacleGrid[0])
      dp = [[ 0 for _ in range(col) ] for _ in range(row)]
      for k in range(row):
        if obstacleGrid[k][0] == 1:
          break
        dp[k][0] = 1

      for k in range(col):
        if obstacleGrid[0][k] == 1:
          break
        dp[0][k] = 1

      for i in range(1,row):
        for j in range(1,col):
          if obstacleGrid[i][j] == 1:
            dp[i][j] = 0
          else:
            dp[i][j] = dp[i-1][j] + dp[i][j-1]
      print(dp)
      return dp[-1][-1]