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, ['6915', 'S', 'Q', '7905', '8529', '5947', '1659', '3019', '2441', 'o', 'H', 'l', '9019', 'x', 'q', '4729', '4427', '7249', 'm', 'c', 'e', 'I', 'F']