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.

9, 12, ['4189', '4575', 'i', 'e', 'Y', '5595', 'U', 'M', 'b', 'n', '5347', 'v', 'w', 'Z', 'F', '503', 'G', '4429', '3087', '295', 'W']
5347

4, 13, ['2921', '5905', '2835', '3625', '2481', '1657', '6239', '2393', 'u', '3255', '7061', '8197', 'k', '269', '1135', '5833', '7847', 'C', '4371', '4783', '9613']
34908

6, 9, ['N', '8761', '4487', 'e', 'N', 'b', '1379', 'm', '7437', '9173', '9433', '5037', 'c', '5343', '4563', '441', 'Q', 'y', '1375', 'a', '5373', '4261', '9033', 'D', '2027', '1065', 'o', 'x', 'E']

8816