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, 17, ['4869', 'd', 'V', 'J', '71', '9333', '851', 'x', 'I', 'x', '3895', 'Q', 'N', 'B', 'x', '3149', 'M', 'G', 'l']