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.
5, 6, ['w', 'w', 'z', 'a', 'r', '8531', '4587', '5315', 'G', '791', 'o', '5837', 'k', '1491', '8171', 'n', 'O', '1497', '9573', '3361', 'W', '989']