```/* nag_zgesv (f07anc) Example Program.
*
* Copyright 2017 Numerical Algorithms Group.
*
* Mark 26.2, 2017.
*/

#include <stdio.h>
#include <nag.h>
#include <nagx04.h>
#include <nag_stdlib.h>
#include <nagf07.h>

int main(void)
{

/* Scalars */
Integer exit_status = 0, i, j, n, nrhs, pda, pdb;

/* Arrays */
Complex *a = 0, *b = 0;
Integer *ipiv = 0;

/* Nag Types */
NagError fail;
Nag_OrderType order;

#ifdef NAG_COLUMN_MAJOR
#define A(I, J) a[(J-1)*pda + I - 1]
#define B(I, J) b[(J-1)*pdb + I - 1]
order = Nag_ColMajor;
#else
#define A(I, J) a[(I-1)*pda + J - 1]
#define B(I, J) b[(I-1)*pdb + J - 1]
order = Nag_RowMajor;
#endif

INIT_FAIL(fail);

printf("nag_zgesv (f07anc) Example Program Results\n\n");

/* Skip heading in data file */
scanf("%*[^\n]");
scanf("%" NAG_IFMT " %" NAG_IFMT "%*[^\n] ", &n, &nrhs);
if (n < 0 || nrhs < 0) {
printf("Invalid n or nrhs\n");
exit_status = 1;
return exit_status;
}

/* Allocate memory */
if (!(a = NAG_ALLOC(n * n, Complex)) ||
!(b = NAG_ALLOC(n * nrhs, Complex)) || !(ipiv = NAG_ALLOC(n, Integer)))
{
printf("Allocation failure\n");
exit_status = -1;
goto END;
}

pda = n;
#ifdef NAG_COLUMN_MAJOR
pdb = n;
#else
pdb = nrhs;
#endif

/* Read A and B from data file */
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
scanf("%*[^\n]");

for (i = 1; i <= n; ++i)
for (j = 1; j <= nrhs; ++j)
scanf(" ( %lf , %lf )", &B(i, j).re, &B(i, j).im);
scanf("%*[^\n]");

/* Solve the equations Ax = b for x using
* nag_zgesv (f07anc).
*/
nag_zgesv(order, n, nrhs, a, pda, ipiv, b, pdb, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_zgesv (f07anc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}

/* Print solution */
printf("Solution\n");

for (i = 1; i <= n; ++i) {
for (j = 1; j <= nrhs; ++j)
printf("( %7.4f, %7.4f)%s", B(i, j).re, B(i, j).im,
j % 4 == 0 ? "\n" : " ");
printf("\n");
}

/* Print details of factorization using
* nag_gen_complx_mat_print_comp (x04dbc).
*/
printf("\n\n");
fflush(stdout);
nag_gen_complx_mat_print_comp(order, Nag_GeneralMatrix, Nag_NonUnitDiag, n,
n, a, pda, Nag_BracketForm, "%7.4f",
"Details of factorization", Nag_IntegerLabels,
0, Nag_IntegerLabels, 0, 80, 0, 0, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_gen_complx_mat_print_comp (x04dbc).\n%s\n",
fail.message);
exit_status = 1;
goto END;
}

/* Print pivot indices */
printf("\nPivot indices\n");
for (i = 1; i <= n; ++i)
printf("%11" NAG_IFMT "%s", ipiv[i - 1], i % 7 == 0 ? "\n" : " ");
printf("\n");

END:
NAG_FREE(a);
NAG_FREE(b);
NAG_FREE(ipiv);

return exit_status;
}

#undef A
#undef B
```