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.
3, 12, ['5437', 'n', '8391', '9309', '3485', '1035', '6303', 'T', 'G', 'e', 'w', 'O', 'S', 'R', 'H', '4271', '9969', 'g', 'G', 'g', '5279', 'C', 'A', 'u', '1283', '5479', 'M', '3763', '4859']