FINDING THE MINOR OF 3 X3 MATRIX IN C

//QUERIES ARE WELCOME AS COMMENTS
# include<stdio.h>
# include<conio.h>
#define C 3
int x = 0, y = 0;
void check(int a[][C], int b[][C-1], int c[][C], int m, int n);
void minor(int b[][C-1],int c[][C]);
void main()
{
int a[C][C], b[C-1][C-1], c[C][C], i ,j;
for(i = 0; i < C; i++)
{
for(j = 0; j < C; j++)
{
printf("ENTER YOUR ELEMENT AT %d X %d\n", i , j);
scanf("%d", &a[i][j]);
}
}
for(i = 0; i< C; i++)
{
for(j = 0; j < C; j++)
{
check(a, b, c, i,j);
}
}
for(i = 0; i < C; i ++)
{
for(j = 0; j < C; j++)
{
printf("%d ",c[i][j]);
}
printf("\n");
}
}
void check(int a[][C], int b[][C-1], int c[][C], int m, int n)
{
int i, j, l = 0, k = 0;
for(i = 0; i< C; i++)
{
for(j = 0; j< C; j++)
{
if (i != m && j != n)
{
b[l][k++]  = a[i][j];
if(k == C-1)
{
l++;
k = 0;
}
}
}
}
minor(b, c);
}
void minor(int b[][C-1],int c[][C])
{
int z;
z = b[0][0] * b[1][1] - b[0][1] * b[1][0];
c[x][y++] = z;
if (y == C)
{
x++;
y = 0;
}
}