Greedy and Random Quasi-Newton Methods with Faster Explicit Superlinear Convergence