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:
1, 17, ['4061', '8041', 'V', '5461', '8247', '3119', 'p', '5313', 'T', 'Z', 'D', '8837', 'B', 'a', '6441', 'O', '8311', 'Z', '473', '9', 'Q', 'E', '2957', 'W', '6263', '3917', '9775', 't']

Ex Output:
57831


Ex Input:
1, 14, ['9503', '5983', '143', 'j', '9227', 'g', 'X', '5995', '6623', 'k', 'q', '1047', '2815', '569', 's', 'D', '4045', 'G', '9707', '6707', '7953', 'R']

Ex Output:
41905


Ex Input:
2, 4, ['o', '2623', '6023', 'N', 'H', '3509', '7751', 'c']

Ex Output:

8646