Find all the coordinates on a path Given a 2D string as input, either as a string with newlines or a list of lines, output the coordinates (x, y) of all the hashes (#) in the list.  The input will only contain hashes and spaces. (and newlines, if you choose to take input as a 2D string)  

If there are no hashes, you can output anything.

Output should be unambiguous as to which numbers are paired with which.

Example:

##


Should output:

(0,0), (1,0)


That assumes 0-based indexing, starting from the top left. You may start from any corner, use 0 or 1-based indexing, and/or output y first. (e.g. in the form y,x).

More test cases (again, all using 0-based top-left (x, y) indexing):

    #
#####
#

(4, 0), (0, 1), (1, 1), (2, 1), (3, 1), (4, 1), (0, 2)


# ###
### #

(0, 0), (2, 0), (3, 0), (4, 0), (0, 1), (1, 1), (2, 1), (4, 1)


Note that these test cases all list by rows, not by following the path.

You may assume the hashes will form a continuous trail, i.e. # # will never be the input. (probably won't matter, but in case somebody wants to regex this)

You also can output the coordinates in any order you want, i.e. vertical columns, horizontal rows, or just an unsorted list.
Slip, 2 + 1 = 3 bytes
+1 byte for the p flag. Code:
`#

Explanation:
The p-flag returns the position of each occurence of the following:
`#      // The character '#'

Try it here!