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, ['4405', '3065', '4429', 'E', '2709', 'Q', 'v', 'V', 'r', 'g', '7759', 'M', '9227', '4751', 'u', 'e', '5555', 'P', '23', 'v', '5357']