Unions of perfect matchings in cubic graphs

We show that any cubic bridgeless graph with m edges contains two perfect matchings that cover at least 3m/5 and three perfect matchings that cover at least 27m/35 of its edges.