Решить задачу на языке СИ

#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <math.h>
#define RAND(min, max) (rand() % ((max) - (min)) + (min))
#define na 3
#define nb 6
#define ma 4
#define mb 11
int main(void) {
size_t n, m;
double** mx = NULL;
size_t i, j;
double max = 0.0;
srand((unsigned)time(NULL));
n = RAND(na, nb);
mx = (double**)malloc(n * sizeof(double*));
m = RAND(ma, mb);
for (i = 0; i < n; ++i) {
mx[i] = (double*)malloc(m * sizeof(double));
for (j = 0; j < m; ++j) {
mx[i][j] = RAND(-99, 100) / 10.0;
printf("%8.1lf", mx[i][j]);
}
puts("");
}
puts("");
for (i = 0; i < n; ++i) for (j = 0; j < m; ++j) {
double next = fabs(mx[i][j]);
if (next > max) max = next;
}
printf("fabs(max) = %.1lf\n\n", max);
for (i = 0; i < n; ++i) for (j = 0; j < m; ++j) mx[i][j] /= max;
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) printf("%8.3lf", mx[i][j]);
puts("");
}
for (i = 0; i < n; ++i) free(mx[i]);
free(mx);
system("pause > nul");
return 0;
}

https://onlinegdb.com/Tcbd3a78a
UPD:
- Добавил srand для разных значений
- Исправил на деление max_elem без модуля

UPD_2: Версия без calloc
https://onlinegdb.com/e_zlqNdVH