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, 19, ['Y', '5315', '551', 'o', '1407', '355', '29', 'h', 'D', '1249', 'Q', '5427', '6325', '1359', 'a', 'T', '9223', '4227', '1397', '8869', '7633', 'H']