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 Q]: 1, 3, ['m', '6287', '41', 'W', '9113', 'P', 'w', 'H', '1651', '8837', '1907', 'e', 'N', 'q', 'j', 'd', 'c', '2459', '6635']
[EX A]: 6328

[EX Q]: 16, 17, ['5985', '1925', 'r', 'H', 'p', 'L', '5019', 'y', 'O', '6575', '9729', 'S', '2497', '43', 'u', '317', 'p', '3043', '3247', 'z', 'O', '8379', '7715', '8399']
[EX A]: 317

[EX Q]: 5, 5, ['1533', 'u', '1355', 'S', '2509', '1525', 'M', 'B', '1363', 'K', '8531', '4475', 'X', '3493', 'V', '4761', '9077', 'k', 'e', '8131', '8453', 'G']
[EX A]:
2509