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.
9, 19, ['6531', '965', 'l', 'K', 'K', 'i', 'F', 'q', 'H', 'g', '5333', 'R', 'k', '875', 't', '665', '5817', '3939', 'R', 'w', 'P', '9639', 'e', 'u', 'P']