Vector => Matrice POINTER

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

int* alocare(int n, int m, int k) {
    int *p;
    if ((p = (int*)malloc(sizeof(int)*n*m*k)) == NULL) {
        printf("Nu exista spatiu in memorie!\n");
        _getch();
        exit(0);
    }
    return p;
}

int maxim(int n, int m,int *p) {// pentru matrice bidimensionala
int max, *p;
max = *p;
for (int i = 0;i < n*m;i++) {
    if (max <= *p);
    max = *p;
    p++;
}
//printf("%d", max);
return max;
}

void init(int n, int m, int k, int *p) {
    int j;
    int *d;
    d = p;
    for (j = 0;j < k;j++) {
        for (int i = 0;i < n*m;i++) {

            printf("[%d][%d][%d]= ", j , i / m, i % m);
            scanf_s("%d", p);
            p++;
        }
    }
    printf("\n");
    p = d;
    printf("Matricea este:");
    for (j = 0;j < k;j++) {
        for (int i = 0; i < n*m; i++) {
            if (i%m == 0)
                printf("\n");
            for (int sp = 0;sp < j;sp++)
                printf(" ");
            printf("%d ", *p);
            p++;
        }
    }
}

void main() {
    int n, m, k;
    int *p;

    printf("Linii: ");
    scanf_s("%d", &n);
    printf("Coloane: ");
    scanf_s("%d", &m);
    printf("Sectiuni: ");
    scanf_s("%d", &k);
    printf("\n");
    p = alocare(n, m, k);
    init(n, m, k, p);

    _getch();
}