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.
10, 22, ['T', 'n', 'w', '8717', '8989', 'F', '4493', '3253', 't', '9459', '2121', '2721', 'b', 'Z', 'j', '9681', 'w', 'O', 'h', 'N', '3653', 'R', '6925', '1637', 'l', 'O', '5307']