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.
15, 18, ['1659', 'H', 'x', '5093', 'x', '9585', '73', '6457', '2801', 'G', '4901', '19', 'O', 'I', 'i', '2913', '2729', 'r', '9411', '413', 'f', '4307', 'J', '9489', '6111', 'E', '3747', '7577', '4397', 'K']