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.
14, 16, ['q', '8629', '8859', '2649', 't', 'n', '6467', '2853', 'u', 'H', 'U', 't', 'x', 'e', '1797', '169', 'd', 'U', 'W', 'K']