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.

Q: 4, 5, ['t', '9215', 'K', 'Q', 'w']

A: 0
****
Q: 12, 19, ['x', 'Z', 'm', '3819', 'D', 'P', '4815', 'D', 'V', '1409', 'u', 'N', 'E', 'A', 'v', 'k', '553', '1869', '6203', '803', '4061']

A: 8625
****
Q: 7, 16, ['P', 'T', '857', '9351', '3953', 'G', '9059', '4587', '7225', '2711', '2349', 'T', 'F', '3887', '1855', 'm', '7605', '5221', '5409']

A:
31673
****