def METHOD_NAME(G, sol):
    r"""
    Parametrize the conic defined by the matrix `G`.
    INPUT:
    - ``G`` -- a `3 \times 3`-matrix over `\QQ`
    - ``sol`` -- a triple of rational numbers providing a solution
      to `x\cdot G\cdot x^t = 0`
    OUTPUT:
    A triple of polynomials that parametrizes all solutions of
    `x\cdot G\cdot x^t = 0` up to scaling.
    ALGORITHM:
    Uses PARI/GP function :pari:`qfparam`.
    EXAMPLES::
        sage: from sage.quadratic_forms.qfsolve import qfsolve, qfparam
        sage: M = Matrix(QQ, [[0, 0, -12], [0, -12, 0], [-12, 0, -1]]); M
        [  0   0 -12]
        [  0 -12   0]
        [-12   0  -1]
        sage: sol = qfsolve(M)
        sage: ret = qfparam(M, sol); ret
        (-12*t^2 - 1, 24*t, 24)
        sage: ret.parent()
        Ambient free module of rank 3 over the principal ideal domain
         Univariate Polynomial Ring in t over Rational Field
    """
    R = QQ['t']
    mat = G.__pari__().METHOD_NAME(sol)
    # Interpret the rows of mat as coefficients of polynomials
    return vector(R, mat.Col())