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.

3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']
45165

3, 4, ['F', '7341', 'P', '3315']
3315

2, 5, ['4407', 'D', '5797', '8907', '3715', '279', '2899', 'p', '6021', 'j', 'A', 'o', '9077', 'J', '3003', '4599', '107', 'Y', '6695', 'O', '7251', '7491', 'Q', '7395', 'k', '231']

18419