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.
6, 12, ['1815', 'B', 'z', 'I', 'k', 'P', 'J', '6951', '9643', 'P', '9037', 'Z', 'p', 'w', 'D', 'R', '9305', 'l', '5041', 'C', '8399', '6157', '3029', '6047', '2315', 'v']