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.
14, 27, ['k', 'N', '2945', 'e', '9815', 'i', 'i', 'c', 's', '8813', 'y', '95', 'q', '5783', '869', '599', '5343', '9073', '8119', 'y', 'v', 'L', '5029', '6595', 'i', 'W', 'w']