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.

11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']
6609

6, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']
3811

16, 17, ['Y', 'M', '8075', '2825', '267', '9977', '8449', 'M', '2917', '6095', 'W', '7305', '7449', 'G', '4087', 'N', '9451', 'b', '7451', 'X', '2273', '2847']

9451