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.
19, 22, ['7459', '8631', 'E', 'A', '9165', 'U', 'f', '6343', 'X', 'w', 'l', 'c', '9667', 'Q', '1179', '3915', 'H', '5067', 'L', 's', 'D', '2757', 'n', '6655', '6939', '2403', 'c']