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.

2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
22725

6, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']
5231

13, 15, ['Z', '3689', 'f', 'g', '6301', 'u', '5261', '1655', 'g', 'Q', '2387', 'L', '107', 'p', 'A', 'F']

107