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.
5, 29, ['7091', 'I', '3729', 'D', 'l', '4763', 'n', 'N', '8927', '4207', 'L', 'r', 'e', '4149', '9831', '6321', 'h', '9391', 'N', '3809', '2913', 'F', 's', '5651', '401', 'n', 'g', 'A', '7405', 'H']