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.
14, 16, ['8637', '2907', 'm', 'x', '4733', 'S', '4829', '4525', 'l', '5507', '7073', 'K', '2239', '5331', '2907', '2795', 't', '8329', 'z', 'g', '5447', 'R', '8675', 'o']