Given is a distributed HashTable with an architecture similar to Chords:

• Elements are mapped to a key within the range [0 ...1023].
• The nodes in the system are organized in a ring.
• A node in the system has an id within the key-range.
• Each node holds a fingertable with 8 entries.
• An element is hosted by the first node whose id is equal or larger than the elements key.

Given the following node setup:

Node 60 receives a request for the element with the key 613. Provide all nodes that process the request.