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.
3, 10, ['I', 'e', '925', 'y', '6755', '7265', 'i', '8397', 'q', '131', 'o', '7685', 'y', '6003', '4239', '3497', 'x', '1939', '7295', 'k', 'n', 'y', '843', '5685']