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.
7, 10, ['3239', '7575', '7813', 'g', 'u', '4539', '4227', '7737', '1777', 'v', 'U', 'N', '9445', '7503', 'Z', '6455', 'F']