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, 15, ['9391', '8073', '6783', 'G', 'R', 'U', '199', 'N', 'X', 'r', 'f', '9577', 'x', 'T', '6833', '8387', '5987', 'd', '1493', '7553', '4395', '5799', 'k', 'Y', 'y']