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, 11, ['q', 'X', 'z', 'G', '4605', '5881', 'o', 'a', 'B', '5511', 'o', '4547', '4983', '8387', '7487', 'v', '5315', 'i', '1673', 'l', 'u', '2145', '6377']