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.
13, 16, ['f', '2489', 'x', '6215', 'Y', 'y', '7015', 'E', '921', 'j', 'V', 'k', '4999', 'w', '4011', '5237', '9725', 't', '4795', '7463', '4295', 'S', '9843', 'p']