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.
10, 20, ['f', '6151', 'J', 'a', 'u', '5531', '557', '2737', 'c', 'S', '6615', '5311', '9069', '6035', '5749', '8707', 'p', 'v', 'T', '4635', '1541', '9139', '5963', '4923', 'z', 'F']