#include <math.h>

#include <stdlib.h>

#include <string.h>

#include <stdio.h>

#include <complex.h>

#ifdef complex

#undef complex

#endif

#ifdef I

#undef I

#endif

#if defined(_WIN64)

typedef long long BLASLONG;

typedef unsigned long long BLASULONG;

#else

typedef long BLASLONG;

typedef unsigned long BLASULONG;

#endif

#ifdef LAPACK_ILP64

typedef BLASLONG blasint;

#if defined(_WIN64)

#define blasabs(x) llabs(x)

#else

#define blasabs(x) labs(x)

#endif

#else

typedef int blasint;

#define blasabs(x) abs(x)

#endif

typedef blasint integer;

typedef unsigned int uinteger;

typedef char *address;

typedef short int shortint;

typedef float real;

typedef double doublereal;

typedef struct { real r, i; } complex;

typedef struct { doublereal r, i; } doublecomplex;

#ifdef _MSC_VER

static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}

static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}

static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}

static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}

#else

static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}

static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}

static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}

static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}

#endif

#define pCf(z) (*_pCf(z))

#define pCd(z) (*_pCd(z))

typedef blasint logical;

typedef char logical1;

typedef char integer1;

#define TRUE_ (1)

#define FALSE_ (0)

/* Extern is for use with -E */

#ifndef Extern

#define Extern extern

#endif

/* I/O stuff */

typedef int flag;

typedef int ftnlen;

typedef int ftnint;

/*external read, write*/

typedef struct

{ flag cierr;

  ftnint ciunit;

  flag ciend;

  char *cifmt;

  ftnint cirec;

} cilist;

/*internal read, write*/

typedef struct

{ flag icierr;

  char *iciunit;

  flag iciend;

  char *icifmt;

  ftnint icirlen;

  ftnint icirnum;

} icilist;

/*open*/

typedef struct

{ flag oerr;

  ftnint ounit;

  char *ofnm;

  ftnlen ofnmlen;

  char *osta;

  char *oacc;

  char *ofm;

  ftnint orl;

  char *oblnk;

} olist;

/*close*/

typedef struct

{ flag cerr;

  ftnint cunit;

  char *csta;

} cllist;

/*rewind, backspace, endfile*/

typedef struct

{ flag aerr;

  ftnint aunit;

} alist;

/* inquire */

typedef struct

{ flag inerr;

  ftnint inunit;

  char *infile;

  ftnlen infilen;

  ftnint  *inex;  /*parameters in standard's order*/

  ftnint  *inopen;

  ftnint  *innum;

  ftnint  *innamed;

  char  *inname;

  ftnlen  innamlen;

  char  *inacc;

  ftnlen  inacclen;

  char  *inseq;

  ftnlen  inseqlen;

  char  *indir;

  ftnlen  indirlen;

  char  *infmt;

  ftnlen  infmtlen;

  char  *inform;

  ftnint  informlen;

  char  *inunf;

  ftnlen  inunflen;

  ftnint  *inrecl;

  ftnint  *innrec;

  char  *inblank;

  ftnlen  inblanklen;

} inlist;

#define VOID void

union Multitype { /* for multiple entry points */

  integer1 g;

  shortint h;

  integer i;

  /* longint j; */

  real r;

  doublereal d;

  complex c;

  doublecomplex z;

  };

typedef union Multitype Multitype;

struct Vardesc {  /* for Namelist */

  char *name;

  char *addr;

  ftnlen *dims;

  int  type;

  };

typedef struct Vardesc Vardesc;

struct Namelist {

  char *name;

  Vardesc **vars;

  int nvars;

  };

typedef struct Namelist Namelist;

#define abs(x) ((x) >= 0 ? (x) : -(x))

#define dabs(x) (fabs(x))

#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))

#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))

#define dmin(a,b) (f2cmin(a,b))

#define dmax(a,b) (f2cmax(a,b))

#define bit_test(a,b) ((a) >> (b) & 1)

#define bit_clear(a,b)  ((a) & ~((uinteger)1 << (b)))

#define bit_set(a,b)  ((a) |  ((uinteger)1 << (b)))

#define abort_() { sig_die("Fortran abort routine called", 1); }

#define c_abs(z) (cabsf(Cf(z)))

#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }

#ifdef _MSC_VER

#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}

#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}

#else

#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}

#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}

#endif

#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}

#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}

#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}

//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}

#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}

#define d_abs(x) (fabs(*(x)))

#define d_acos(x) (acos(*(x)))

#define d_asin(x) (asin(*(x)))

#define d_atan(x) (atan(*(x)))

#define d_atn2(x, y) (atan2(*(x),*(y)))

#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }

#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }

#define d_cos(x) (cos(*(x)))

#define d_cosh(x) (cosh(*(x)))

#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )

#define d_exp(x) (exp(*(x)))

#define d_imag(z) (cimag(Cd(z)))

#define r_imag(z) (cimagf(Cf(z)))

#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))

#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))

#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )

#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )

#define d_log(x) (log(*(x)))

#define d_mod(x, y) (fmod(*(x), *(y)))

#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))

#define d_nint(x) u_nint(*(x))

#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))

#define d_sign(a,b) u_sign(*(a),*(b))

#define r_sign(a,b) u_sign(*(a),*(b))

#define d_sin(x) (sin(*(x)))

#define d_sinh(x) (sinh(*(x)))

#define d_sqrt(x) (sqrt(*(x)))

#define d_tan(x) (tan(*(x)))

#define d_tanh(x) (tanh(*(x)))

#define i_abs(x) abs(*(x))

#define i_dnnt(x) ((integer)u_nint(*(x)))

#define i_len(s, n) (n)

#define i_nint(x) ((integer)u_nint(*(x)))

#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))

#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))

#define pow_si(B,E) spow_ui(*(B),*(E))

#define pow_ri(B,E) spow_ui(*(B),*(E))

#define pow_di(B,E) dpow_ui(*(B),*(E))

#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}

#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}

#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}

#define s_cat(lpp, rpp, rnp, np, llp) {   ftnlen i, nc, ll; char *f__rp, *lp;   ll = (llp); lp = (lpp);   for(i=0; i < (int)*(np); ++i) {           nc = ll;          if((rnp)[i] < nc) nc = (rnp)[i];          ll -= nc;           f__rp = (rpp)[i];           while(--nc >= 0) *lp++ = *(f__rp)++;         }  while(--ll >= 0) *lp++ = ' '; }

#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))

#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }

#define sig_die(s, kill) { exit(1); }

#define s_stop(s, n) {exit(0);}

static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";

#define z_abs(z) (cabs(Cd(z)))

#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}

#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}

#define myexit_() break;

#define mycycle() continue;

#define myceiling(w) {ceil(w)}

#define myhuge(w) {HUGE_VAL}

//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}

#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}

/* procedure parameter types for -A and -C++ */

#ifdef __cplusplus

typedef logical (*L_fp)(...);

#else

typedef logical (*L_fp)();

#endif

static float spow_ui(float x, integer n) {

  float pow=1.0; unsigned long int u;

  if(n != 0) {

    if(n < 0) n = -n, x = 1/x;

    for(u = n; ; ) {

      if(u & 01) pow *= x;

      if(u >>= 1) x *= x;

      else break;

    }

  }

  return pow;

}

static double dpow_ui(double x, integer n) {

  double pow=1.0; unsigned long int u;

  if(n != 0) {

    if(n < 0) n = -n, x = 1/x;

    for(u = n; ; ) {

      if(u & 01) pow *= x;

      if(u >>= 1) x *= x;

      else break;

    }

  }

  return pow;

}

#ifdef _MSC_VER

static _Fcomplex cpow_ui(complex x, integer n) {

  complex pow={1.0,0.0}; unsigned long int u;

    if(n != 0) {

    if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;

    for(u = n; ; ) {

      if(u & 01) pow.r *= x.r, pow.i *= x.i;

      if(u >>= 1) x.r *= x.r, x.i *= x.i;

      else break;

    }

  }

  _Fcomplex p={pow.r, pow.i};

  return p;

}

#else

static _Complex float cpow_ui(_Complex float x, integer n) {

  _Complex float pow=1.0; unsigned long int u;

  if(n != 0) {

    if(n < 0) n = -n, x = 1/x;

    for(u = n; ; ) {

      if(u & 01) pow *= x;

      if(u >>= 1) x *= x;

      else break;

    }

  }

  return pow;

}

#endif

#ifdef _MSC_VER

static _Dcomplex zpow_ui(_Dcomplex x, integer n) {

  _Dcomplex pow={1.0,0.0}; unsigned long int u;

  if(n != 0) {

    if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];

    for(u = n; ; ) {

      if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];

      if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];

      else break;

    }

  }

  _Dcomplex p = {pow._Val[0], pow._Val[1]};

  return p;

}

#else

static _Complex double zpow_ui(_Complex double x, integer n) {

  _Complex double pow=1.0; unsigned long int u;

  if(n != 0) {

    if(n < 0) n = -n, x = 1/x;

    for(u = n; ; ) {

      if(u & 01) pow *= x;

      if(u >>= 1) x *= x;

      else break;

    }

  }

  return pow;

}

#endif

static integer pow_ii(integer x, integer n) {

  integer pow; unsigned long int u;

  if (n <= 0) {

    if (n == 0 || x == 1) pow = 1;

    else if (x != -1) pow = x == 0 ? 1/x : 0;

    else n = -n;

  }

  if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {

    u = n;

    for(pow = 1; ; ) {

      if(u & 01) pow *= x;

      if(u >>= 1) x *= x;

      else break;

    }

  }

  return pow;

}

static integer dmaxloc_(double *w, integer s, integer e, integer *n)

{

  double m; integer i, mi;

  for(m=w[s-1], mi=s, i=s+1; i<=e; i++)

    if (w[i-1]>m) mi=i ,m=w[i-1];

  return mi-s+1;

}

static integer smaxloc_(float *w, integer s, integer e, integer *n)

{

  float m; integer i, mi;

  for(m=w[s-1], mi=s, i=s+1; i<=e; i++)

    if (w[i-1]>m) mi=i ,m=w[i-1];

  return mi-s+1;

}

static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {

  integer n = *n_, incx = *incx_, incy = *incy_, i;

#ifdef _MSC_VER

  _Fcomplex zdotc = {0.0, 0.0};

  if (incx == 1 && incy == 1) {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];

      zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];

    }

  } else {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];

      zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];

    }

  }

  pCf(z) = zdotc;

}

#else

  _Complex float zdotc = 0.0;

  if (incx == 1 && incy == 1) {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);

    }

  } else {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);

    }

  }

  pCf(z) = zdotc;

}

#endif

static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {

  integer n = *n_, incx = *incx_, incy = *incy_, i;

#ifdef _MSC_VER

  _Dcomplex zdotc = {0.0, 0.0};

  if (incx == 1 && incy == 1) {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];

      zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];

    }

  } else {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];

      zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];

    }

  }

  pCd(z) = zdotc;

}

#else

  _Complex double zdotc = 0.0;

  if (incx == 1 && incy == 1) {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc += conj(Cd(&x[i])) * Cd(&y[i]);

    }

  } else {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);

    }

  }

  pCd(z) = zdotc;

}

#endif  

static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {

  integer n = *n_, incx = *incx_, incy = *incy_, i;

#ifdef _MSC_VER

  _Fcomplex zdotc = {0.0, 0.0};

  if (incx == 1 && incy == 1) {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];

      zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];

    }

  } else {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];

      zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];

    }

  }

  pCf(z) = zdotc;

}

#else

  _Complex float zdotc = 0.0;

  if (incx == 1 && incy == 1) {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc += Cf(&x[i]) * Cf(&y[i]);

    }

  } else {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);

    }

  }

  pCf(z) = zdotc;

}

#endif

static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {

  integer n = *n_, incx = *incx_, incy = *incy_, i;

#ifdef _MSC_VER

  _Dcomplex zdotc = {0.0, 0.0};

  if (incx == 1 && incy == 1) {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];

      zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];

    }

  } else {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];

      zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];

    }

  }

  pCd(z) = zdotc;

}

#else

  _Complex double zdotc = 0.0;

  if (incx == 1 && incy == 1) {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc += Cd(&x[i]) * Cd(&y[i]);

    }

  } else {

    for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */

      zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);

    }

  }

  pCd(z) = zdotc;

}

#endif

/*  -- translated by f2c (version 20000121).

   You must link the resulting object file with the libraries:

  -lf2c -lm   (in that order)

*/

/* > \brief \b SLASCL multiplies a general rectangular matrix by a real scalar defined as cto/cfrom. */

/*  =========== DOCUMENTATION =========== */

/* Online html documentation available at */

/*            http://www.netlib.org/lapack/explore-html/ */

/* > \htmlonly */

/* > Download SLASCL + dependencies */

/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slascl.

f"> */

/* > [TGZ]</a> */

/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slascl.

f"> */

/* > [ZIP]</a> */

/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slascl.

f"> */

/* > [TXT]</a> */

/* > \endhtmlonly */

/*  Definition: */

/*  =========== */

/*       SUBROUTINE SLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO ) */

/*       CHARACTER          TYPE */

/*       INTEGER            INFO, KL, KU, LDA, M, N */

/*       REAL               CFROM, CTO */

/*       REAL               A( LDA, * ) */

/* > \par Purpose: */

/*  ============= */

/* > */

/* > \verbatim */

/* > */

/* > SLASCL multiplies the M by N real matrix A by the real scalar */

/* > CTO/CFROM.  This is done without over/underflow as long as the final */

/* > result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that */

/* > A may be full, upper triangular, lower triangular, upper Hessenberg, */

/* > or banded. */

/* > \endverbatim */

/*  Arguments: */

/*  ========== */

/* > \param[in] TYPE */

/* > \verbatim */

/* >          TYPE is CHARACTER*1 */

/* >          TYPE indices the storage type of the input matrix. */

/* >          = 'G':  A is a full matrix. */

/* >          = 'L':  A is a lower triangular matrix. */

/* >          = 'U':  A is an upper triangular matrix. */

/* >          = 'H':  A is an upper Hessenberg matrix. */

/* >          = 'B':  A is a symmetric band matrix with lower bandwidth KL */

/* >                  and upper bandwidth KU and with the only the lower */

/* >                  half stored. */

/* >          = 'Q':  A is a symmetric band matrix with lower bandwidth KL */

/* >                  and upper bandwidth KU and with the only the upper */

/* >                  half stored. */

/* >          = 'Z':  A is a band matrix with lower bandwidth KL and upper */

/* >                  bandwidth KU. See SGBTRF for storage details. */

/* > \endverbatim */

/* > */

/* > \param[in] KL */

/* > \verbatim */

/* >          KL is INTEGER */

/* >          The lower bandwidth of A.  Referenced only if TYPE = 'B', */

/* >          'Q' or 'Z'. */

/* > \endverbatim */

/* > */

/* > \param[in] KU */

/* > \verbatim */

/* >          KU is INTEGER */

/* >          The upper bandwidth of A.  Referenced only if TYPE = 'B', */

/* >          'Q' or 'Z'. */

/* > \endverbatim */

/* > */

/* > \param[in] CFROM */

/* > \verbatim */

/* >          CFROM is REAL */

/* > \endverbatim */

/* > */

/* > \param[in] CTO */

/* > \verbatim */

/* >          CTO is REAL */

/* > */

/* >          The matrix A is multiplied by CTO/CFROM. A(I,J) is computed */

/* >          without over/underflow if the final result CTO*A(I,J)/CFROM */

/* >          can be represented without over/underflow.  CFROM must be */

/* >          nonzero. */

/* > \endverbatim */

/* > */

/* > \param[in] M */

/* > \verbatim */

/* >          M is INTEGER */

/* >          The number of rows of the matrix A.  M >= 0. */

/* > \endverbatim */

/* > */

/* > \param[in] N */

/* > \verbatim */

/* >          N is INTEGER */

/* >          The number of columns of the matrix A.  N >= 0. */

/* > \endverbatim */

/* > */

/* > \param[in,out] A */

/* > \verbatim */

/* >          A is REAL array, dimension (LDA,N) */

/* >          The matrix to be multiplied by CTO/CFROM.  See TYPE for the */

/* >          storage type. */

/* > \endverbatim */

/* > */

/* > \param[in] LDA */

/* > \verbatim */

/* >          LDA is INTEGER */

/* >          The leading dimension of the array A. */

/* >          If TYPE = 'G', 'L', 'U', 'H', LDA >= f2cmax(1,M); */

/* >             TYPE = 'B', LDA >= KL+1; */

/* >             TYPE = 'Q', LDA >= KU+1; */

/* >             TYPE = 'Z', LDA >= 2*KL+KU+1. */

/* > \endverbatim */

/* > */

/* > \param[out] INFO */

/* > \verbatim */

/* >          INFO is INTEGER */

/* >          0  - successful exit */

/* >          <0 - if INFO = -i, the i-th argument had an illegal value. */

/* > \endverbatim */

/*  Authors: */

/*  ======== */

/* > \author Univ. of Tennessee */

/* > \author Univ. of California Berkeley */

/* > \author Univ. of Colorado Denver */

/* > \author NAG Ltd. */

/* > \date June 2016 */

/* > \ingroup OTHERauxiliary */

/*  ===================================================================== */

/* Subroutine */ void slascl_(char *type__, integer *kl, integer *ku, real *

  cfrom, real *cto, integer *m, integer *n, real *a, integer *lda, 

  integer *info)

{

    /* System generated locals */

    integer a_dim1, a_offset, i__1, i__2, i__3, i__4, i__5;

    /* Local variables */

    logical done;

    real ctoc;

    integer i__, j;

    extern logical lsame_(char *, char *);

    integer itype, k1, k2, k3, k4;

    real cfrom1;

    extern real slamch_(char *);

    real cfromc;

    extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);

    real bignum;

    extern logical sisnan_(real *);

    real smlnum, mul, cto1;

/*  -- LAPACK auxiliary routine (version 3.7.0) -- */

/*  -- LAPACK is a software package provided by Univ. of Tennessee,    -- */

/*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */

/*     June 2016 */

/*  ===================================================================== */

/*     Test the input arguments */

    /* Parameter adjustments */

    a_dim1 = *lda;

    a_offset = 1 + a_dim1 * 1;

    a -= a_offset;

    /* Function Body */

    *info = 0;

    if (lsame_(type__, "G")) {

  itype = 0;

    } else if (lsame_(type__, "L")) {

  itype = 1;

    } else if (lsame_(type__, "U")) {

  itype = 2;

    } else if (lsame_(type__, "H")) {

  itype = 3;

    } else if (lsame_(type__, "B")) {

  itype = 4;

    } else if (lsame_(type__, "Q")) {

  itype = 5;

    } else if (lsame_(type__, "Z")) {

  itype = 6;

    } else {

  itype = -1;

    }

    if (itype == -1) {

  *info = -1;

    } else if (*cfrom == 0.f || sisnan_(cfrom)) {

  *info = -4;

    } else if (sisnan_(cto)) {

  *info = -5;

    } else if (*m < 0) {

  *info = -6;

    } else if (*n < 0 || itype == 4 && *n != *m || itype == 5 && *n != *m) {

  *info = -7;

    } else if (itype <= 3 && *lda < f2cmax(1,*m)) {

  *info = -9;

    } else if (itype >= 4) {

/* Computing MAX */

  i__1 = *m - 1;

  if (*kl < 0 || *kl > f2cmax(i__1,0)) {

      *info = -2;

  } else /* if(complicated condition) */ {

/* Computing MAX */

      i__1 = *n - 1;

      if (*ku < 0 || *ku > f2cmax(i__1,0) || (itype == 4 || itype == 5) && 

        *kl != *ku) {

    *info = -3;

      } else if (itype == 4 && *lda < *kl + 1 || itype == 5 && *lda < *

        ku + 1 || itype == 6 && *lda < (*kl << 1) + *ku + 1) {

    *info = -9;

      }

  }

    }

    if (*info != 0) {

  i__1 = -(*info);

  xerbla_("SLASCL", &i__1, (ftnlen)6);

  return;

    }

/*     Quick return if possible */

    if (*n == 0 || *m == 0) {

  return;

    }

/*     Get machine parameters */

    smlnum = slamch_("S");

    bignum = 1.f / smlnum;

    cfromc = *cfrom;

    ctoc = *cto;

L10:

    cfrom1 = cfromc * smlnum;

    if (cfrom1 == cfromc) {

/*        CFROMC is an inf.  Multiply by a correctly signed zero for */

/*        finite CTOC, or a NaN if CTOC is infinite. */

  mul = ctoc / cfromc;

  done = TRUE_;

  cto1 = ctoc;

    } else {

  cto1 = ctoc / bignum;

  if (cto1 == ctoc) {

/*           CTOC is either 0 or an inf.  In both cases, CTOC itself */

/*           serves as the correct multiplication factor. */

      mul = ctoc;

      done = TRUE_;

      cfromc = 1.f;

  } else if (abs(cfrom1) > abs(ctoc) && ctoc != 0.f) {

      mul = smlnum;

      done = FALSE_;

      cfromc = cfrom1;

  } else if (abs(cto1) > abs(cfromc)) {

      mul = bignum;

      done = FALSE_;

      ctoc = cto1;

  } else {

      mul = ctoc / cfromc;

      done = TRUE_;

  }

    }

    if (itype == 0) {

/*        Full matrix */

  i__1 = *n;

  for (j = 1; j <= i__1; ++j) {

      i__2 = *m;

      for (i__ = 1; i__ <= i__2; ++i__) {

    a[i__ + j * a_dim1] *= mul;

/* L20: */

      }

/* L30: */

  }

    } else if (itype == 1) {

/*        Lower triangular matrix */

  i__1 = *n;

  for (j = 1; j <= i__1; ++j) {

      i__2 = *m;

      for (i__ = j; i__ <= i__2; ++i__) {

    a[i__ + j * a_dim1] *= mul;

/* L40: */

      }

/* L50: */

  }

    } else if (itype == 2) {

/*        Upper triangular matrix */

  i__1 = *n;

  for (j = 1; j <= i__1; ++j) {

      i__2 = f2cmin(j,*m);

      for (i__ = 1; i__ <= i__2; ++i__) {

    a[i__ + j * a_dim1] *= mul;

/* L60: */

      }

/* L70: */

  }

    } else if (itype == 3) {

/*        Upper Hessenberg matrix */

  i__1 = *n;

  for (j = 1; j <= i__1; ++j) {

/* Computing MIN */

      i__3 = j + 1;

      i__2 = f2cmin(i__3,*m);

      for (i__ = 1; i__ <= i__2; ++i__) {

    a[i__ + j * a_dim1] *= mul;

/* L80: */

      }

/* L90: */

  }

    } else if (itype == 4) {

/*        Lower half of a symmetric band matrix */

  k3 = *kl + 1;

  k4 = *n + 1;

  i__1 = *n;

  for (j = 1; j <= i__1; ++j) {

/* Computing MIN */

      i__3 = k3, i__4 = k4 - j;

      i__2 = f2cmin(i__3,i__4);

      for (i__ = 1; i__ <= i__2; ++i__) {

    a[i__ + j * a_dim1] *= mul;

/* L100: */

      }

/* L110: */

  }

    } else if (itype == 5) {

/*        Upper half of a symmetric band matrix */

  k1 = *ku + 2;

  k3 = *ku + 1;

  i__1 = *n;

  for (j = 1; j <= i__1; ++j) {

/* Computing MAX */

      i__2 = k1 - j;

      i__3 = k3;

      for (i__ = f2cmax(i__2,1); i__ <= i__3; ++i__) {

    a[i__ + j * a_dim1] *= mul;

/* L120: */

      }

/* L130: */

  }

    } else if (itype == 6) {

/*        Band matrix */

  k1 = *kl + *ku + 2;

  k2 = *kl + 1;

  k3 = (*kl << 1) + *ku + 1;

  k4 = *kl + *ku + 1 + *m;

  i__1 = *n;

  for (j = 1; j <= i__1; ++j) {

/* Computing MAX */

      i__3 = k1 - j;

/* Computing MIN */

      i__4 = k3, i__5 = k4 - j;

      i__2 = f2cmin(i__4,i__5);

      for (i__ = f2cmax(i__3,k2); i__ <= i__2; ++i__) {

    a[i__ + j * a_dim1] *= mul;

/* L140: */

      }

/* L150: */

  }

    }

    if (! done) {

  goto L10;

    }

    return;

/*     End of SLASCL */

} /* slascl_ */