Through K or L

Difficulty: Medium · Topics: Discrete Mathematics, Combinations, Paths

Square ABCD is divided into 9 equal squares. A cyclist starts at A and, moving only right or up along the lines, rides to C.

graph "x":[-0.7,3.7],"y":[-0.7,3.7],"axes":false,"ink":true,"label":"A 3 by 3 grid from A (bottom left) to C (top right) with points K and L on the diagonal","items":["type":"line","from":[0,0],"to":[3,0],"ink":true,"width":1.2,"type":"line","from":[0,1],"to":[3,1],"ink":true,"width":1.2,"type":"line","from":[0,2],"to":[3,2],"ink":true,"width":1.2,"type":"line","from":[0,3],"to":[3,3],"ink":true,"width":1.2,"type":"line","from":[0,0],"to":[0,3],"ink":true,"width":1.2,"type":"line","from":[1,0],"to":[1,3],"ink":true,"width":1.2,"type":"line","from":[2,0],"to":[2,3],"ink":true,"width":1.2,"type":"line","from":[3,0],"to":[3,3],"ink":true,"width":1.2,"type":"point","at":[0,0],"label":"A","anchor":"sw","ink":true,"type":"point","at":[3,0],"label":"B","anchor":"se","ink":true,"type":"point","at":[3,3],"label":"C","anchor":"ne","ink":true,"type":"point","at":[0,3],"label":"D","anchor":"nw","ink":true,"type":"point","at":[1,1],"label":"K","anchor":"se","ink":true,"type":"point","at":[2,2],"label":"L","anchor":"se","ink":true]

In how many ways can the cyclist get from A to C passing through at least one of K and L?