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, 10, ['91', 'w', 'k', '1485', '5563', 'z', '9971', '8169', '8719', '7525', '6531', '8633', 'X', 'u', '8493', '9761', '4363', 'k', 'K', '593', '3903', '6857']