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.
12, 17, ['6941', 'Z', '5123', 'v', '9673', '7829', '1559', '855', 't', 'e', 'G', '1861', 'H', 'g', '25', '1465', 'W', 'R', 'P', '2731']