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, 2, ['8895', 't', '5739']
8895

15, 24, ['987', '1799', 'q', '4969', '7401', 'M', '1637', '423', 'D', '2883', 'O', '5667', 'z', 'k', '6791', 'O', 'o', '4693', '6961', 'E', 'k', 'm', 'g', 'O', '7131', 'I', '7671']
18445

12, 13, ['3731', '1161', 'd', '5041', 'Y', 'U', '7289', '8069', '9141', '777', '9889', '1661', '4049', 'r', 'e', 'r', 'Z', '6733', '4711']

5710