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.
6, 19, ['4273', 'Y', 'q', 'X', '1365', '5013', '4179', 'y', '5657', '5613', 'W', 's', 'u', '5473', '7729', 'k', '8727', '8825', 'Z', '1107', '2017', 'p', 'L', '6961']