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.

1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
23119

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

17, 22, ['2231', 'u', 'd', '6071', 'P', '7847', 'x', '9', '9499', 'Z', 'd', 'f', '4703', 'h', '8965', 'P', '3513', 'F', 'a', '5371', 'y', '3479', '361', '2981', '5043', 't', 'N', 'L', '587', '5123']

12363