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, 21, ['v', 'Q', '2041', 'n', 'n', '3667', '3681', '597', 'N', '3229', '9233', '7873', 'M', '7665', 'n', '6967', '6689', '6543', 'Y', 'i', 'q', 'D']