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, 16, ['441', 'P', 'r', 'C', '1451', 'r', 'P', '5685', 's', 's', '1099', 'U', 'G', '3727', '6755', 'v', '6561', 'x', 'w', 'e', '6819', '7613', '4507', 'G']