Let be integers satisfying , and let be a graph that contains a collection of pairwise disjoint paths and a collection of pairwise disjoint paths. Suppose that every path in intersects every path in , and that each path consists of consecutive (vertex-disjoint) segments such that for each , intersects only in its -th segment. Then contains an grid subgraph.