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.
7, 13, ['7381', '9617', 'Q', 'S', 'i', 'C', '3085', 'k', '7393', 'c', 'l', 'Q', 'F', '1651', '1479', '2367', '9859', '5819', 'g', '5691', 'H', '5165', 'X', '3529', 'a', 'J']