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.
8, 8, ['5761', 'e', 'Z', 'T', 'i', '1271', 'K', '7703', '7313', 'X', '2111', 'T', 'x', 'H', '5471', 'L', '4369', 'U', 'w', '2269', 'D', 'Z']