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.
18, 22, ['s', '5355', '6775', 'C', '4489', 'w', '8335', 'q', '2671', 'i', 'S', 'R', '7125', 't', 'j', '5095', '9039', '8617', '6565', 'S', 'h', '4063', 'G']