Generate a Python program that has the following intention:

The intention of the program is to recursively divide the number a by b until b becomes 0.

The function p1(a, b) takes two arguments, a and b, and returns the result of dividing a by b. If b is not equal to 0, the function calls itself recursively with the arguments a % b and b, where % is the modulo operator that returns the remainder of the division of a by b.

The recursion continues until b becomes 0, at which point the function returns a. This function can be used to perform a recursive division of a by b until the quotient reaches 1.

For example, if a is 10 and b is 3, the function will first divide 10 by 3, which gives a quotient of 3 and a remainder of 1. The function will then divide 1 by 3, which gives a quotient of 1 and a remainder of 1. The function will continue to divide 1 by 3 until the quotient becomes 1, at which point the function returns 1.

Overall, the intention of the program is to perform a recursive division of a by b until the quotient reaches 1.