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.
15, 16, ['j', '8529', 'C', '493', 'C', 'v', '9231', '3083', 'O', '3969', '4507', 'J', '6325', 'A', 'H', '4763', 'E']