Cell with the least total walking distance to all targets around walls

A grid has targets, empty cells and walls. Walking moves up, down, left or right and cannot cross walls. Find a non-wall cell whose summed walking distance to every target is as small as possible and return that sum (or report that no cell reaches all targets).