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.
6, 16, ['7289', '3543', '6879', 'q', '8125', '9055', 'A', '3761', '2433', '791', '8215', 's', '4549', 'o', 'b', 'W', 'z']