Let S be a subset of the reals such that S&cap;[a,b] and S<sup>c</sup>&cap;[a,b] cannot be written as a countable union of closed sets for any a&lt;b. This can be done (this <a href="http://planetmath.org/?op=getobj&from=objects&id=11351">explicit example of a non-Borel set</a> achieves this). Let &#x0211a; be the rationals. Then, A=(Sx&#x0211a;)U(S<sup>c</sup>x&#x0211a;<sup>c</sup>) and B=(Sx&#x0211a;<sup>c</sup>)U(S<sup>c</sup>x&#x0211a;) should do it.

The proof is as follows. Suppose that the curve t&rarr;(f(t),g(t)) lies in A, and consider a closed bounded interval I. As the curve lies in A, f(I)&cap;S = f(I&cap;g<sup>-1</sup>(&#x0211a;))=&cup;<sub>x&isin;&#x0211a;</sub>f(I&cap;g<sup>-1</sup>(x)) is a union of countably many closed sets. By the choice of S, f(I) must be a single point. Hence, f is constant. Then, g is a continuous function mapping into either &#x0211a; or &#x0211a;<sup>c</sup>, so is also constant. So A is totally path disconnected. The argument for B follows in the same way by exchanging S and S<sup>c</sup>