In this challenge, your task is to write three programs that form a kind of mutual quine-like system.
Let's call the programs
If one of the programs is given the source of another program as input, it shall output the source of the third program.
For example, if
A is given
B as input, it outputs
If the programs are given their own source as input, they shall output the three strings
"quines" (without quotes).
In all cases, they may output one additional trailing newline.
For any other inputs, the programs may do anything, including crash.
For example, suppose that the source codes of
Then the programs should behave as follows.
Source Input Output
aSdf aSdf three
aSdf ghJk zxcV
aSdf zxcV ghJk
ghJk aSdf zxcV
ghJk ghJk mutual
ghJk zxcV aSdf
zxcV aSdf ghJk
zxcV ghJk aSdf
zxcV zxcV quines
Rules and scoring
C can be either functions or full programs, but they must be completely independent: no shared code is allowed.
Standard loopholes and quine rules apply, so the programs can't access their own source codes in any way.
Your score is the combined byte count of
C, lower score being better.