#include <stdio.h>
#include <stdlib.h> 


int
main(int argc, char *argv[])
{
    if (argc!=3) {
        fprintf(stderr, "%s m n\n", argv[0]);
        return 0;
    }

    int m = atoi(argv[1]), n = atoi(argv[2]);
    int numElements = 2*m*n;
    int numNodes = (m+1)*(n+1);
    int numInteriorNodes = (m-1)*(n-1);

    int element[numElements][3];
    double node[numNodes][2];

    int p[numNodes], q[numNodes];
    int cInt = 0;
    int cBound = numNodes-1;

    double hx = 1./m, hy = 1./n;
    int i, j, cNode, cElement=0;

    for (i=0; i<=m; ++i) {
        for (j=0; j<=n; ++j) {
            cNode = j+i*(m+1);
            node[cNode][0] = i*hx;
            node[cNode][1] = j*hy;
            
            if ((i>0)&&(i<m)&&(j>0)&&(j<n)) {
                q[cNode] = cInt;
                p[cInt++] = cNode;
            } else {
                q[cNode] = cBound;
                p[cBound--] = cNode;
            }
        }
    }

    for (i=0; i<m; ++i) {
        for (j=0; j<n; ++j) {
            cNode = j+i*(m+1);

            element[cElement][0] = q[cNode];
            element[cElement][1] = q[cNode+1];
            element[cElement][2] = q[cNode+m+1];
            ++cElement;
            
            element[cElement][0] = q[cNode+1];
            element[cElement][1] = q[cNode+m+1];
            element[cElement][2] = q[cNode+m+2];
            ++cElement;
        }
    }
    printf("%d\n", numNodes);
    printf("%d\n", numInteriorNodes);
    printf("%d\n", numElements);
    for (i=0; i<numNodes; ++i) {
        printf("%.15lf %.15lf\n", node[p[i]][0], node[p[i]][1]);
    }
    for (i=0; i<numElements; ++i) {
        printf("%d %d %d\n", element[i][0], element[i][1], element[i][2]);
    }
    /*
    printf("\n");
    for (i=0; i<numNodes; ++i) {
        printf("q[%d] = %d\n", i, q[i]);
    }
    for (i=0; i<numNodes; ++i) {
        printf("p[%d] = %d\n", i, p[i]);
    }
    */
    return 0;
}