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.
3, 6, ['9057', '9357', '7191', '8135', 'e', '4797', 'i', '6507', 'H', 'E', '4815', '427', '1159', '7917', 'O', '2009', 'S']