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.
8, 12, ['v', '3849', 'F', 'z', 'j', 'G', 'P', '5285', 'w', 'E', 'F', '9239', '7429', '6121', '8191', 'z', 'V', '3009', 'F', '507', '9737', '1145', '4523', 'Q']