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.
16, 27, ['H', 'u', '587', '9381', 'F', '2123', '2863', 'E', 'Y', 'm', '1033', 's', 'n', '8419', 'U', 'C', '9347', '7897', '5405', '8865', 'V', 'K', 'W', 'R', '8129', '4777', '1053', 'M']