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.
17, 21, ['819', '4819', '665', 'X', 'L', '9673', '1523', '9459', 'j', '4565', '5051', 'e', '83', '5581', 'F', '5917', 'j', 'v', '3439', 'm', 'M']