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.
15, 16, ['6307', 'R', '1525', 'z', '6793', '7791', 'w', '5147', 'a', 'M', '157', '321', '8483', '5991', 'r', 'd', 'R', 'L', '6391', '6043', '8831', '9903', 's', '8643', '4903']