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, 17, ['v', 'f', 'e', 'j', '1463', '9087', '837', '3843', 'U', 'T', '7351', '2219', 'd', '9355', '3613', 'q', 'G', 'k', '9685', 'G', 'V', 'I', 'Q']