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.
15, 17, ['4905', 'B', '9375', 'Z', '8351', 'q', 'm', 'J', '7861', '8107', '1143', 'i', 'R', '9101', '523', '4541', '851', '7107', 'v', '4219']