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.

16, 29, ['1431', 'a', '7223', '5743', '4571', 'q', 'Z', '3415', '6237', '1537', '5403', 'Y', 'K', '1949', 'p', '2641', '3307', 'X', 'O', 'q', 'T', 'n', '845', '1489', '161', '8515', '8735', '5065', '4973', '9287']
35731

8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']
5430

3, 22, ['6929', '2887', '4699', 'x', '5241', 'w', 'B', '5893', '7485', '1677', '4509', '343', 'I', 'U', 'Y', '3355', '5831', '6465', 'f', '351', '5867', '9591', 'j', 'C']

61307