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.
3, 20, ['9965', 'i', '3685', 'R', 'l', '7331', 'e', 'g', '1487', 'Z', 'c', 'O', '1439', 'N', 'A', '7261', '2227', 'l', 'z', '6913', 'T', '7105', 'H', 'w', '5661']