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.
4, 11, ['E', '9349', '7459', '8773', '1165', '1171', '6563', 'c', '9877', '753', 'j', 'q', '815', '2811', 'u', '499', '2915', 'J', '6661', '2229', 'T', '1261', 'r', '713', 'k']