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.
8, 16, ['3507', '7847', '185', '5009', '4565', '7089', 'Z', 'P', '4019', '9595', '2153', '6871', '4793', 'q', 'l', '7557', '9529']