Problem Statement

Imagine a communication system where text data is sent through a network channel. During transmission, individual characters are dispatched along with their positional identifiers. Due to network latency and routing variations, these characters may arrive at the destination in a scrambled sequence rather than their original order. You receive a series of character-position pairs representing the incoming data stream. A complete message spanning from position l to position r must satisfy these criteria: The content cannot be empty It must be bounded by two "*" symbols - specifically, at positions l-1 and r+1 , the "*" character must be present Example: "*greetings*" represents a complete message where "greetings" is the valid content. However, "*greetings**" would be invalid since "**" represents a gap in the sequence. Your objective is to process each incoming character and position it according to its index_number . The momen