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, 11, ['9135', '2127', '9135', '8643', 'r', 'S', '1705', '5563', 'o', '9497', '5693', 'N', 'x', '8381', '4619', '2851', '917', '4513', 'U', '7667', '1115', '309', 'S', 't', 'q', '3277']