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.
16, 19, ['R', 'Y', '7803', '5139', 'm', '9527', 'z', '2647', 'k', '6411', 'Z', '5547', 'O', '2557', '8319', '5881', 'v', 'W', '3001', 'k', 'x', 'I', '1365', 'F', '7751']