Given a finite set of integer vectors, S, we consider the set of all lattice walks whose allowable step directions come from S. We partition the set of all such walks according to their length (the number of steps used) and terminal point. In several cases, we are able to give explicit combinatorial formulas that count the number of such paths. We conclude with a Frobenius-type problem for lattice walks with prescribed steps.