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.
16, 19, ['9293', '9123', '5167', 'Y', '9265', '9355', 'M', 's', '8359', 'A', 'F', 'Z', 'B', '5717', '4149', 'h', 'l', 'n', '2457', 'm', '2537', 'K', 'L', '5439']