In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
11, 19, ['387', '1891', 'a', 'B', '3219', 'A', 'P', '9319', 'C', 'd', '9501', 'G', '885', 'k', '6899', 'a', '7391', 'd', 'l']