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.

Ex Input:
7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']

Ex Output:
6189


Ex Input:
8, 14, ['i', '2929', '9353', 'T', '5451', 'n', 'y', '2861', 's', 'G', '7717', '3833', '3753', 'u', 'E', 'T', 'I']

Ex Output:
18164


Ex Input:
12, 19, ['1379', '9715', '2341', '8719', 'D', '9997', 'R', '4509', '6703', '6775', 'f', '9581', '6269', 'X', '4385', 'M', '6287', 'E', 'm', 'W', 'p', 'm', 'F', 'V', '9143']

Ex Output:

26522