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.
13, 19, ['a', '2167', 'n', '7747', '465', '1693', 'T', 'f', 'E', 'a', 'x', '9493', 'V', '4791', 'l', '3923', 'K', '2659', '3711', 'c', '7149']