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

int n = 0;
int sort_data[28] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,
    13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27};

int compare(const void *pa, const void *pb)
{
    printf("%d x %d = %d\n", n/8+2, n%8+2, (n/8+2)*(n%8+2));
    n++;

    return (*((int*)pa) - *((int*)pb));
}

int main(void)
{
    qsort(sort_data, 28, sizeof(int), compare);

    return 0;
}