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.

11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']
6609

6, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']
9771

4, 11, ['4167', 'k', '683', 'J', '5411', '1061', 't', '5063', '523', '1515', '7307', 'P', '875', '3527', 'Z', '2971', 'g', '5843', '6113', '8575', '6407', '2387', '1751']

20880