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, 14, ['9851', '8107', 'K', '8651', '3393', 'L', '5591', '2117', 'P', 'W', '3679', '7243', 'Z', '7595', '3539', 'N', 'q', 'u', '9999', '7057', '1489', 'y', '1901', 'l', 's']