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, 19, ['9979', 'd', 'Y', '4089', 'P', 'e', '451', '4155', 'l', '2867', '8505', '3757', 'g', 'F', '3065', '3007', '2633', 'u', 'l', '9299', 'u', '3255', '3403']