```    Program c06fpfe

!     C06FPF Example Program Text

!     Mark 26.2 Release. NAG Copyright 2017.

!     .. Use Statements ..
Use nag_library, Only: c06fpf, c06fqf, nag_wp
!     .. Implicit None Statement ..
Implicit None
!     .. Parameters ..
Integer, Parameter               :: nin = 5, nout = 6
!     .. Local Scalars ..
Integer                          :: i, ieof, ifail, j, m, n
!     .. Local Arrays ..
Real (Kind=nag_wp), Allocatable  :: trig(:), u(:), v(:), work(:), x(:)
!     .. Executable Statements ..
Write (nout,*) 'C06FPF Example Program Results'
!     Skip heading in data file
loop: Do
If (ieof<0) Then
Exit loop
End If

Allocate (trig(2*n),u(n),v(n),work(2*m*n),x(m*n))
Do j = 1, m
End Do
Write (nout,*)
Write (nout,*) 'Original data values'
Write (nout,*)
Write (nout,99999)('     ',(x(i*m+j),i=0,n-1),j=1,m)

!       ifail: behaviour on error exit
!              =0 for hard exit, =1 for quiet-soft, =-1 for noisy-soft
ifail = 0
Call c06fpf(m,n,x,'Initial',trig,work,ifail)

Write (nout,*)
Write (nout,*) 'Discrete Fourier transforms in Hermitian format'
Write (nout,*)
Write (nout,99999)('     ',(x(i*m+j),i=0,n-1),j=1,m)
Write (nout,*)
Write (nout,*) 'Fourier transforms in full complex form'

Do j = 1, m
u(1:n) = x(j:m*n:m)
v(1:n) = 0.0_nag_wp
v(2:(n+1)/2) = u(n:n-(n-1)/2+1:-1)
u(n:n-(n-1)/2+1:-1) = u(2:(n+1)/2)
v(n-(n-1)/2+1:n) = -v((n+1)/2:2:-1)
Write (nout,*)
Write (nout,99999) 'Real ', u(1:n)
Write (nout,99999) 'Imag ', v(1:n)
End Do

x((n/2+1)*m+1:m*n) = -x((n/2+1)*m+1:m*n)
Call c06fqf(m,n,x,'Subsequent',trig,work,ifail)

Write (nout,*)
Write (nout,*) 'Original data as restored by inverse transform'
Write (nout,*)
Write (nout,99999)('     ',(x(i*m+j),i=0,n-1),j=1,m)
Deallocate (trig,u,v,work,x)
End Do loop

99999 Format (1X,A,6F10.4)
End Program c06fpfe
```