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.

2, 10, ['907', '3413', 'y', 'Y', 'y', '9671', '6631', 'g', '8803', '3127', 'k', 'Y', '413', '3871', '909', 'G', '4431', '6489', '7291', 'J', 'W', '6423', '641', 'G', '2545', '4471', '3717', '2671', '561']
31645

2, 3, ['h', 'w', '3397']
3397

3, 14, ['J', '5037', '909', '8661', '7787', '8935', '3137', 'o', 'E', '7245', '769', '8513', '5409', 'z', '3741', 'Q', 'U', '7777', 'M', '4117', 'd', 'g']

51365