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.
2, 12, ['M', '2259', '349', '5689', 'V', 'j', 'm', 'R', '3345', 'p', 'p', '1751', '3623', '653', '3729', '9709', 'W', 'I', '7487']