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, ['v', '5691', '4973', 'J', 'w', '539', '6957', '9953', 'L', 'c', '5879', 'b', 'g', '6681', 'C', '753', '5835', '1023', 'w', '5713', '159', 'X', 'z', 'i', '8379', '9753', '195', 'X']

Ex Output:
13313


Ex Input:
1, 11, ['q', 'q', 'P', '4335', 'l', 'k', 'D', 'R', '719', 'g', '855', 'l', '6639', '7935', '8407', 'A', 'H', '8357', '759', 'i', '1205', 'B', 'Q', 'V', '359', '4565', '9975', 'g', 'h', '9585']

Ex Output:
5909


Ex Input:
5, 14, ['E', '5491', '7707', '7723', 'Q', 'X', '435', 'T', 'c', '5981', '4039', '7617', 'y', '7691', '5473', 'X', '8517', '9917', 'Q', 'l', 'A']

Ex Output:

25763