Find the number of pathways from A to B if you can only travel to the right and down. I would like to solve the following, using Pascal's Triangle. Since there are shapes withing shapes, I am unsure as to where I should place the values. 
EDIT 1:

Where do I go from here? How do I get the value for the next vertex?
EDIT 2:

Okay, how does this look? From this, I would have 22 pathways. 

You can do this algorithmically by labeling $B$ as $1$ and then repeating the following algorithm:

Choose some vertex such that every vertex reachable to the right or down from it is labeled. Label this by the sum of the label of the vertex to the right and the label of the vertex below (when these exist).

Which represents counting the number of paths from that vertex to $B$ since you can choose to either go down or right from any vertex. Eventually, you'll reach $A$ as you go backwards through the graph labeling things.
