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, 14, ['X', 'O', 'c', 'T', '2983', '2171', 'R', '7399', '6959', '3529', '2743', '4105', '9313', '6713', 'b', 'g', '9189', 'C', '8641', 'J', 'J']