I’m working on a c programming question and need guidance to help me study.

Needs to be in the C language

Input will begin with a line containing 1 integers, n (1 ? n ? 100,000), representing the number ofrooks to process. The first line will be followed by n more lines. The i-th following line containstwo integers, r and c (1 ? r, c ? 1,000,000,000), representing the rank and file of the i-th rook.The i-th rook will have the ID of i.No two rooks will be in the same spot. The number of unique ranks and files will be at most10,000.

Output should contain n lines. The i-th line will start with an integer t, representing the numberof rooks that can attack the i-th rook. Following t should be t integers on the same line. Eachinteger will represent the ID of the rook that can attack the current rook. Each rook ID shouldoccur only once in the line. All integers in the line should be separated by spaces. Order of theIDs does not matter.