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.
6, 6, ['x', '4099', '6637', '9499', 'e', 'o', '4923', '2897', '3595', 'H', 'p', 'x', 'j', 'o', '8743', 'e', '2433', '9199', 'j', 'W', 'a']