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.
5, 19, ['m', '6399', '5503', 'M', 'z', 'Q', '8585', 'F', 'q', 'd', 'G', '5097', 'R', 'e', 'z', '8157', 'c', 't', '6557', 'f', 'X', '1029', '6649', 'p', '3891', '949', '2311', 'M', 'f']