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, 21, ['8959', '3981', 'W', '901', '9747', '8311', 'n', '7497', '6013', 'L', 'p', 'N', '4155', 'o', '3767', '7519', '4605', '6739', 'c', 'Z', '3629', 'X', '167', 'G', 'V', '905', '4567', 'b']