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, 21, ['927', '3395', '1165', 't', 'a', 'L', '9661', '9779', '775', 'v', 'O', 'Q', '7237', 'z', 't', 'l', '1065', '9695', '8901', '9197', 'W', '2177', 'K', 'M', 'g', '4917', '177', 'n', '4241']