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, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']
4452

2, 2, ['M', '3453', '5733', '2337', '9975', '1827', 't', '4937']
3453

4, 4, ['7601', '9677', '1855', '4889', 'z', '8833', 'N', '6629', '7411', '881', '399', '407', '2245', '7235', '8453', 'W', 'o']

4889