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.
12, 14, ['d', '2523', '2711', '4123', '3627', 'E', 'T', '5039', '689', 'K', 'O', 'v', 'd', '9159', '6907', '4271', '9231', '925']