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.
6, 16, ['6685', '123', 'k', '9847', '8539', '9799', 'z', '2049', 'w', 'C', 'p', 'Q', 'G', '3959', '2487', 'U', '2383', '2851', 'e', 'e', 'e', '7277', 'n', '1379', '6331']