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.
21, 22, ['v', 'U', 'E', 'u', 'S', '7873', 'M', 'p', 'I', 'l', '5965', '5537', 'w', 'T', 'F', '1447', '6759', 'U', 'D', 'X', '3891', '597', '2519', '7737', 'd', 'r', '4255', '3137']