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.
1, 12, ['8145', 'r', '3303', 'x', '3341', 'g', '5079', 'X', '6573', 'p', '9161', '7227', 'N', '3517', 'k', '4919', 'G', '6905', '7091', 'Y']