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, 17, ['w', 'I', 's', '4733', 's', '4837', 'j', 'a', '3759', 'e', '5313', 'm', 'n', 'R', '8611', '6741', '4525', 'o', 'j', 'H', 'f', '7809', '9121', '3671', 'j', '1537', 'v', '7561', '9853']