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.
2, 9, ['9067', '35', 'I', 'z', '5599', 'R', '7909', '2927', '2707', 'z', 'l', 'V', 'o', '8065', '9879', 'w', 'z', 'H', '3347', '2073', '2591', '5429', '5731', '9377', 'p']