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:
9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']

Ex Output:
4364


Ex Input:
3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Ex Output:
22632


Ex Input:
15, 21, ['L', '1773', '521', '1777', 'I', 'e', 'F', '8167', '4347', 'Y', 'H', 'm', 'd', '3691', 'z', '7723', 'Z', 'K', 'h', 'r', '1857', '5379', 'A', '2503', '6187', '2539', '7041', 'F']

Ex Output:

9580