You are handed a graph with vertices in a neutral color and asked to color a subset of vertices with expensive paints in d colors in such a way that only the trivial symmetry preserves the color classes. Your goal is to minimize the number of vertices needing this expensive paint. This paper address the issues surrounding your choices. A graph is said to be d-distinguishable if there exists a vertex coloring with d colors so that only the trivial automorphism preserves the color classes. The smallest d for which G is d-distinguishable is called the distinguishing number of G, and is denoted Dist(G). A determining set for a graph G is a subset of vertices whose pointwise stabilizer is trivial. The determining number of G is the size of a smallest determining set, and is denoted Det (G). For any d ≥ Dist(G), we define the paint cost of d-distinguishing, denoted ρd(G), to be the minimum number of vertices that need to be painted to d-distinguish G. For a given G, the paint cost varies with d. We show that ρd(G) achieves its maximum value at d = Dist(G), and call this maximum value the maximum paint cost, denoted ρmax(G). Further we show that for all d ≥ Dist(G), Det (G) ≤ ρd(G) and that there exist d for which equality holds. We define the frugal distinguishing number of G, denoted Fdist(G), to be the smallest d for which ρd(G) = Det (G). Lastly, we find these parameters for the book graph Bm, n. In particular, for n ≥ 2 and m ≥ 4, we show that Det (Bm, n) = n − 1; if k = Dist(Bm, n), then ρmax(Bm, n) ≥ (m−2)(n−km − 3) + 1; Fdist(Bm, n) = 2 + ⌊(n−1)/(m−2)⌋.