Write a program to implement the transpose $($must$-$do$),$

addition $($must$-$do$),$ and multiplication $($optional$)$

operations of two given sparse matrices. NOTE: use

the advanced triple list as the data structure for storing

sparse matrices.

Input:

First line: input two integers $m$ and $n,$ which

represent the row number and the column

number respectively.

Then input the triples. Each triple $($row column

value$)$ takes a line, and ended with $000.$

Output:

The transposed matrix. Each triple takes a line.