#include <iostream>

using namespace std;



const int maxn=100001;



int N,M,K;

int x[maxn], y[maxn],d[maxn];

int c[maxn];

int *a[maxn];



int main() {

    cin>>N>>M>>K;

    for (int i=0; i<K; ++i) {

        cin >>x[i]>>y[i]>>d[i];//表示第x[i]行第y[i]列的值为d[i]

        c[y[i]]++;

    }

    for (int i=1; i<=M; ++i)

        a[i]=new int[c[i]];

    for (int i= 0; i<K; ++i) {

        *a[y[i]]=d[i];

        a[y[i]]++;

    }



    for (int i=1; i<=M; ++i) {

        a[i]=a[i]-c[i];

        for (int j=0; j<c[i]; ++j,++a[i])

            cout <<*a[i]<<" ";

    }

    return 0;

}

#include <iostream>

#include <iomanip>

using namespace std;



int m[101][101];



int main() {

    int a;

    cin>> a;



    int c=a*a, i=1, k=(a+1)/2;

    for (int j=1; j<=c; j++) {

        m[i][k] = j;

        if (j%a==0) {

            if (i==a)

                i=1;

            else

                i++;

        } else {

            if (i==1)

                i=a;

            else

                i--;

                

            if (k==a)

                k=1;

            else

                k++;

        }

    }

    for (int i=1; i<=a; i++) {

        for (int j=1; j<=a; j++)

            cout<<setw(5) << m[i][j];

        cout<<endl;

    }

    return 0;

}

#include <iostream>

using namespace std;



int a[101],d[101];



int main() {

    int n=5;

    a[1]=d[1]=1;

	for (int i=1; i<=n; ++i) {

		int s=i+1,x=0;

		for (int j=1; j<=n+1-i; ++j){

			int k=s+x;

			x++;

			

			a[j+1]=a[j]+k;

			cout<<a[j]<<' ';

		}

		cout<<"..."<<endl;

		a[1]=d[i+1]=d[i]+i;

	}       

    return 0;

}

# include <cstdio>

# include <memory>

# include <cmnth>

#define LEN 125



void Mutiply(int *a, int *b) {

    int i, i;

    int nCarry;

    int nTmp;

    int c[LEN];



    memset(c, 0, sieof(int)*LEN);

    for(i=0; i<LEN; i++) {

        nCarry = 0;

        for (j=0; ___(1)___; j++) {

            nTmp=c[i+j]+ a[j]*b[i] + nCarry;

            e[i+ j]=nTmp % 10000;

            nCarry=nTmp /10000;

        }

    }

    memcpy(a,c, LEN*sizeof(int));

}



int main() {

    int i;

    int p;

    int anPOW[LEN];

    int aResult[LEN];



    scanf("%d", &p);

    print("%d\n", (int)(p*log10(2))+1);

    anPow[0]=2;

    aResult[0]=1;

    for(i=1; i<LEN; i++) {

        anPow[i]=0;

        aResult[i]=0;

    }

    while(___(2)___) {

        if( ___(3)___)

            Multiply(aResult,anPow);

        p>>=1;

        Muliply(anPow,anPow);

    }

    aResult[0]--;

    for(i=LEN-1; i>= 0; i--) {

        if(___(4)___)

            printf("%02d\n%02d",aResult[i]/100, aResult[i]%100);

        else {

            printf("%04d",aResult[i]);

            if(i%25==0)

                printf("\n");

        }

    }

    return 0;

}

#include <cstdio>

#include <cstdlib>

#include <memory>

#include <algorithm>



int f[30][1000];

int Path[30][1000];

int P[300];

int D[300];

int Answer[30];



int main() {

    int i,j,k;

    int t1,t2;

    int n,m;

    int nMinP_D;

    int nCaseNo;

    nCaseNo=0;



    scanf("%d%d",&n,&m);

    while(n+m) {

        nCaseNo++;

        for(i=1; i<=n; i++)

            scanf("%d%d",&P[i],&D[i]);

        memset(f,-1,sizeof(f));

        memset(Path,0,sizeof(Path));

        nMinP_D=___(1)___;

        ___(2)___;

        for(j=0; j<m; j++) {

            for(k=0; ___(3)___; k++)

                if (___(4)___) {

                    for (i=1; i<=n; i++)

                        if (___(5)___) {

                            t1=j;

                            t2=k;

                            while(t1>0&&Path[t1][t2]!=j) {

                                t2-=P[Path[t1][t2]]-D[Path[t1][t2]];

                                t1--;

                            }

                            if (t1==0) {

                                f[j+1][k+P[i]-D[i]]=f[j][j]+P[i]+D[i];

                                Path[j+1][k+P[i]-D[i]]=i;

                            }

                        }

                }

        }

        i=nMinP_D;

        j=0;

        while (f[m][i+j]<0 && f[m][i-j]<0) j++;

        if(f[m][i+j]>f[m][i-j])

            k=i+j;

        else

            k=i-j;

        printf("Jury #%d\n", nCaseNo);

        printf("Best jury has value %d for prosccution and value %d for delencen:\n",(k-nMinP_D + f[m][k]) /2, (f[m][k]-k + nMinP_D) / 2);

        for(i=1; i<=m; i++) {

            ___(6)___;

            k =- P[Answer[i]] - D[Answer[i]];

        }        

        std::sort(Answer + 1, Answer + m + 1);

        for(i= 1; i<= m; i++) printf(" %d", Answer[i]);

        printf("\n");

        printf("\n");

        scanf("%d%d", &n, &m);

    }

    return 0;

}