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, 30, ['6505', '8735', 'y', 'l', 'z', '2527', '989', '5617', 'P', '2031', '8411', '8529', '2795', 'q', 'A', 'Q', 'a', 's', '4915', 'S', '2053', 'C', '3755', '1531', '6905', 'v', 'L', 'Z', 'v', 'c']