• Nie Znaleziono Wyników

James Arthur - Get Down tekst piosenki

N/A
N/A
Protected

Academic year: 2022

Share "James Arthur - Get Down tekst piosenki"

Copied!
1
0
0

Pełen tekst

(1)

James Arthur, Get Down

Outside there's a bird and it is singing And outside of my window, there's a life I feel like someone's talking to my spirit They tell me that there's reasons to survive I could draw you a picture

I could write on my face

I could read you a scripture of tales And I know, no matter how much colder Or how much I carry on my shoulders As long as I'm standing, I'll be closer Cause it ain't over, 'til it's over

But we don't get down No we don't get down We can turn this 'round And maybe

It's today ahh yeahh

Cause all these scenes of grief got my head spinnin' And we're dancing on the edge of a knife

And could I be your hero or your villain Uhh, I guess it just depends in whose eyes I could draw you a picture

I could write on my fist

I could read you a scripture of this And I know, no matter how much colder Or how much I carry on my shoulders As long as I'm standing, I'll be closer Cause it ain't over, 'til it's over

But we don't get down No we don't get down We can turn this 'round And maybe

It's today ahh yeahh And I don't get down Cause you lift me up [7x] No I don't get down Cause you lift me up

And I know, no matter how much colder Or how much I carry on my shoulders As long as I'm standing, I'll be closer Cause it ain't over, 'til it's over

But we don't get down No we don't get down We can turn this 'round And maybe

It's today ahh yeahh

James Arthur - Get Down w Teksciory.pl

Cytaty

Powiązane dokumenty

Proszę o wysłanie na mój adres mailowy lub messenger ćwiczeń znajdujących się pod linkiem obok https://drive.google.com/open?id=1s_LntyeBeNe-SiiRDWNGJQTDeAfyNEol. Można je pobrać w

Also the proof of the theorem is similar and is based on the comparison with the geometric series (the reader is advised to carry out the proof in the case of positive terms).

In a bipartite graph, the size of a maximal matching equals the minimal number of blocking vertices (B ⊆ V is blocking if every arc either starts in B or ends in it). Hall’s

Therefore, Theorem 4.3 may be generalized to all line graphs of multigraphs which possess maximal matchable subsets of vertices – for example, the line graphs of multigraphs

Some classes of difference graphs (paths, trees, cycles, special wheels, com- plete graphs, complete bipartite graphs etc.) were investigated by Bloom, Burr, Eggleton, Gervacio,

The following three lemmata describe properties of sum labellings for strong hypercycles with n ≥ 2d + 1 vertices; they are needed to prove the main result of this section..

Dzieci piszą też zdania przeczące dotyczące miejsc, których nie ma na ulicy Flower Street.. Uczniowie uczą się też odpowiadać krótko na

Słownictwo związane z nazwami budynków użyteczności