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, 3, ['3335', '3451', 'f', 'M']
3451

3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
14032

9, 12, ['L', 'b', 'x', '865', '8047', 'N', 'U', 'q', '8151', 'M', 'p', 'W', 'C', '7633', '8037', '4697', 'Q', '5193', '7605', '5441', '8775', '9773', 'u', '5433', 'N', '8267', '5789', '5039', '7117']

8151