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.

1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']
25374

10, 16, ['V', 'b', '2575', '385', 'U', 'I', 'Y', '2647', 'V', 'k', '6379', 'W', '1883', 'n', 'K', '3001', '6791', 'I', '4285', 'f', 'i']
11263

15, 19, ['C', 'i', 'C', '3679', '7225', '8149', 'm', '1767', '1239', '7237', '2951', 'N', '7307', 'r', 'N', 'l', 'q', '4313', 'W', '5967', '8637', '3835', '3527', '9929', 'f', 'B', '9197', 'g']

4313