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.
3, 9, ['3149', 'B', 'l', 'y', '1423', '2403', 'H', '8753', 'j', 'J', '3099', '1661', 'F', 'S', 'O', 'g', 'l', 'K', 'Z', '8689', '9093']