Definition: 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.
Input: 10, 19, ['G', '7871', 'S', 'M', '6701', '2895', 'f', '2939', '8381', '3607', '2899', '8767', 'P', 'k', 'J', 'T', '9733', '8631', '3055', 'g', '3195', '3777', 't', '5943', 'Q', '9587', '411', 'M', 'C', '9049']

36692