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, 11, ['3245', '8869', 'm', '2421', '6021', 'w', 'H', 'g', 'g', 'S', '8197', 'V', 'j', '9851', 'N', '753', '1799', 'O', '3779', 'H', 'E', 'k', 'S', '5649', 'Y', '579', '3173', '4937', '8675']