Given a (possibly improper) edge colouring of a graph , a vertex colouring of is adapted to if no colour appears at the same time on an edge and on its two endpoints. A graph is called (for some positive integer ) if for any list assignment to the vertices of , with for all , and any edge colouring of , admits a colouring adapted to where for all . This paper proves that a planar graph is adaptably 3-choosable if any two triangles in have distance at least 2 and no triangle is adjacent to a 4-cycle.