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.
2, 19, ['j', 'E', '5795', 'I', 'r', 'x', 's', '833', 'X', '7183', 'Y', 'N', '9997', '7651', '5725', 'F', 'C', '6347', 'a', 'n', '1239', '787', 'Y', 'b', '2643', '8759', 'n', '1051', 'Q', 'h']