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.
2, 15, ['s', '5409', '6493', '7911', '4187', '4609', '5099', '8927', 'k', '6059', 'E', 'n', 'D', '2331', '9813', 'H', '2763', 'b', 's', '759', 'E']