Is it possible to get the largest conceivable score in Hearts? I should explain the necessary rules: in the four-player game of Hearts, the object is to get as few points as possible. The points you receive are determined by the cards you pick up through a hand: hearts are worth $1$ point each, and the queen of spades is worth $13$ points. Players can thus receive any score between 0 and 25 on a given hand. However, if on a hand a player obtains all 13 hearts and the queen of spades, then that player receives $0$ points and all other players receive $26$ points, an act referred to as "shooting the moon".
The game ends when a player exceeds $100$ points, at which point the player with the fewest points is the winner. In this way, the best conceivable score is
$$
\begin{matrix}0&99&99&99\end{matrix} → \begin{matrix}0&125&125&125\end{matrix}
$$
My question is, is this score possible? And, more generally, how can one determine whether any given score in Hearts is possible?
As best I can tell, we must determine whether $\left[\begin{matrix}99\\99\\99\end{matrix}\right]$ is a linear combination of all the possible final scores. 
I would lean towards the idea that this is not possible; it is simple to produce even multiples of 13:
$$
\begin{matrix}0&0&13&13 \\ 0&13&26&13 \\ 0&26&26&26\end{matrix}
$$
But I cannot think of a good way to produce any given score.

After each hand, the sum of all the scores must be a multiple of 26.
