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.

Q: 2, 5, ['W', 'A', 'm', 'w', 'r', '9705', '1729', 'U', '2171', 'Q', 'Y', 'P', 'O']

A: 0
****
Q: 2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']

A: 28268
****
Q: 24, 28, ['1485', 's', 'y', 'V', 'j', '1157', '3397', 'R', 'Q', '6579', 'V', '1811', 'i', '8073', 'l', 'i', '8353', '3561', 'k', 'R', 'O', 'Q', 'X', 'M', 'z', '2671', '895', '1081', '8989']

A:
4647
****