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.
10, 14, ['391', '9291', 'h', 'm', 'd', 'n', 'y', '8701', 'p', '4157', '4973', 'Y', '7367', '8687', 'n', '3463', '177', '1721', 'm', 'z', 'x', '7313', '5797', '1913', '1527']